10:20

Self Custody of DOT tokens

48:28

Launching a Polkadot Parachain - National University of Singapore, 2024

08:41

9.1 Introduction to Turing Machines

05:06

13.1 Theory of Computation - P, NP, NP-Complete and NP-Hard

03:24

11.3 Theory of Computation - Reducibility EQTM

07:39

11.2 Theory of Computation - Reducibility ETM

10:04

11.1 Theory of Computation - Reducibility

09:44

10.2 Theory of Computation - Undecidability

06:09

10.1 Theory of Computation - Decidability

05:02

10.2 Python Sets

06:41

10.1 Python Dictionaries

05:58

9.1 Strings in Python

06:59

8.1 Pushdown Automata

02:55

8.3 Lists vs Tuples

06:00

8.2 Programs with Lists

07:51

8.1 Introduction to Lists

02:57

7.2 Formal Definition Context-Free Grammar

04:27

7.1 Context Free Languages

05:47

7.3 Errors and Exceptions

06:00

7.2 File Processing

07:06

7.1 File Input and Output

05:52

6.3 Pumping Lemma Revisited

11:00

6.2 Pumping Lemma

03:48

6.1 Non Regular Languages

03:11

6.2 Python Libraries - Math and Random

05:00

6.1 Value Returning Functions

04:34

5.4 Menu Driven Programs

09:55

5.1 Introduction to Regular Expressions

06:54

5.3 DFA to GNFA to Regular Expression

06:29

5.2 Regular Expression to NFA

06:29

5.3 Local vs Global variables

04:17

5.2 Main function

06:34

5.1 Introduction to functions

07:35

4.4 Nested Loops

08:49

4.3 NFA DFA Equivalence

04:18

4.2 Formal Definition of NFA

08:10

4.1 Introduction to NFAs

06:15

4.3 For Loop

07:28

4.2 While Loop

02:14

4.1 Loops in Programming

11:31

3.3 Regular Languages closed under Intersection and Union

07:05

3.2 Regular Languages - Closed under Complement

10:13

3.1 Formal Definition of Deterministic Finite Automata

06:27

3.3 Logical Operators

06:43

3.2 Relational Operators

06:59

3.1 Conditional Statements

09:07

2.3 Introduction to Automata - Theory of Computation

06:46

2.2 Symbols and Languages - Theory of Computation

06:41

2.1 Uncountability - Theory of Computation

08:20

2.3 Output Formatting

05:53

2.4 Programming Style

09:24

2.2 Input, Processing and Output

05:51

2.1 Designing a Program

09:24

1.2 Theorems and Proofs - Theory of Computation

10:12

1.1 Mathematical Terminology - Theory of Computation

05:07

1.3 Introduction to Python and IDLE

05:52

1.2 Introduction to Programming

05:39

1.1 Introduction to Computers

05:39

1.4 Binary Numbers - An overview

08:56

Intelligent Tutors for Loops and Recursion - LearnLab Summer School 2020, Carnegie Mellon University