Computability Theory
Download as PDF
Overview
Subject area
CMP
Catalog Number
416
Course Title
Computability Theory
Department(s)
Description
Mathematical formulation of computability theory and abstract machine theory. Finite-state machines and Turing machines; Church-Turing Thesis; recursive functions and recursively enumerable sets; unsolvability and the Halting Problem. PREREQ: CMP 232 and CMP 326.
Typically Offered
Fall, Spring
Academic Career
Undergraduate
Liberal Arts
Yes
Credits
Minimum Units
4
Maximum Units
4
Academic Progress Units
4
Repeat For Credit
No
Components
Name
Lecture
Hours
4
Requisites
010992