Review of models of computation and basic undecidability. Recursive function theory, including degrees of unsolvability. Completeness and consistency of theories (Gödel). Information-based computability theory (Chaitin).
Prerequisite: 500.
News & Events | People | Academics | Research | Jobs | Companies | Visitors | Computer Facilities | Home
