 |
| Topic |
Countability Example 3 (set of all strings over sigma are countable) | TOC | Automata Theory
 |
| Lecture |
 |
| Notes |
|
| Topic |
Countability Example 4 (set of all turing machine's are countable) | TOC | Automata Theory
|
| Lecture |
|
| Notes |
|
| Topic |
Diagonalization Method (set of all languages are uncountable) | Countability | TOC | Automata Theory
|
| Lecture |
|
| Notes |
 |
| Bookmarks |
0 Comments
Post a Comment