2017-18 Catalog

Search Results

MATH 329 Computability Theory 3-4 Credits

Core development of classical computability theory: enumeration, index and recursion theorems, various models of computation and Church's Thesis, uncomputability results, introduction to reducibilities and their degrees (in particular, Turing degrees, or degrees of uncomputability), computable operators and their fixed points.
Attribute/Distribution: MA