Computability
Download as PDF
Overview
Subject area
CSC
Catalog Number
42200
Course Title
Computability
Department(s)
Description
Sheperdson-Sturgis machines. Elements of recursive function theory. The equivalence of the class of computable and recursive functions. Church's thesis; other models of computation: Post machines, Turing machines, semi-Thue systems, etc. Unsolvable problems and introduction to their classification. Subrecursive formalism.
Academic Career
Undergraduate
Liberal Arts
No
Credits
Minimum Units
3
Maximum Units
3
Academic Progress Units
3
Repeat For Credit
No
Components
Name
Lecture
Hours
3
Requisites
019282