Lecture Notes
|
1 |
Can we compute every function on natural numbers? |
|
|
2 |
Set, Relation and Function |
|
|
3 |
Injection, Surjection and Bijection |
|
|
4 |
Countable, Denumerable and Finite Sets |
|
|
5 |
Beyond Countability |
|
|
6 |
Two Faces of Computation |
|
|
7 |
Calculus of Lambda Terms |
|
|
8 |
Reduction of Lambda Terms |
|
|
9 |
Lambda Definable Functions |
|
|
10 |
Turing Machine |
|
|
11 |
Variants of TM |
|
|
12 |
Context-Free Grammar |
|
|
13 |
CNF & CKY Algorithm |
|
|
14 |
Decidability |
|
|
15 |
Time Compexity |