 |
| Topic |
Mod-01 Lec-40 TMs can simulate computers, diagonalization proof.
 |
| Lecture |
 |
| Notes |
|
| Topic |
Mod-01 Lec-41 Existence of non-r.e. languages, recursive languages, notion of decidability.
|
| Lecture |
|
| Notes |
|
| Topic |
Mod-01 Lec-42 Separation of recursive and r.e. classes, halting problem and its undecidability.
|
| Lecture |
|
| Notes |
 |
| Bookmarks |
0 Comments
Post a Comment