Stony Brook University Logo Computer Science
CSE 633 Back to Advanced Courses

Course CSE633
Title Computability and Undecidability

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
Credit Information 3 - credits
Course Goals  
Course Webpage  
[an error occurred while processing this directive]