PHIL 170
Computation Theory
The nature and limits of symbol manipulation. Automata theory: McCulloch-Pitts networks; the relationship between machines and languages; computable functions; abacuses; the relationship between computation and formal logic; Gödel's incompleteness theorems for arithmetic. Recommendations: One or more courses taken from PHIL 33, EE 14, MATH 70 (formerly MATH 46), COMP 15.
Sources
- Course catalogue ↗Current public catalogue; retrieved 2026-11-05