The Theory of Computable Functions   [Archived Catalog]
2017-2018 Graduate Studies Bulletin (Archived Copy)
   
Print-Friendly Page (opens a new window)

MATH 761 - The Theory of Computable Functions

Credits: 3

Models of computation; recursive functions, random access machines, Turing machines, and Markov algorithms; Church's Thesis; universal machines and recursively unsolvable problems; recursively enumerable sets; the recursion theorem; the undecidability of elementary arithmetic.



Print-Friendly Page (opens a new window)
Close Window
   
All bulletins © 2025 Columbia Campus.
Powered by the Acalog™ Academic Catalog Management System™ (ACMS™).

Mobile Site.