Search Results

MATH 3730. Computability Theory. 3 Credits.

The unlimited register machine as a model of an idealized computer. Computable and partial computable functions; Church–Turing thesis. Kleene’s recursion theorem. Algorithmic enumerability. Unsolvability of the halting problem and other theoretical limitations on what computers can do. Discussion of Goedel’s incompleteness theorem. Prerequisite: MATH 2971 or permission of instructor.

Master of Science in the Field of Applied Mathematics

...Logic , MATH 3720 Axiomatic Set Theory , MATH 3730 Computability Theory , MATH 3740 Computational Complexity , MATH...