CSE633
| Course | CSE633 |
| Title | Computability and Undecidability |
| Description |
Computability theory based on Turing machines and recursive functions; proof by diagonalization and reducibility; unsolvable problems in set, group, number, and language theory; reducibility orderings and degrees of unsolvability; priority methods and Post's problem. |
| Prerequisite |
CSE 540 |
| Credits | 3 - credits |
| Course Outcomes | |
| Textbook | |
| Course Webpage |
|