PHIL 152 - Computability and Logic

Description
Approaches to effective computation: recursive functions, register machines, and Turing machines. Proof of their equivalence, discussion of Church's thesis. Elementary recursion theory. These techniques used to prove Gödel's incompleteness theorem for arithmetic, whose technical and philosophical repercussions are surveyed. Prerequisite: 151. Class Notes: This course will be meeting only 9 a.m. to 10:20 a.m.
Credits
4
Recent Professors
Open Seat Checker
Schedule Planner
Recent Semesters
Spring 2019, Spring 2018
Offered
MW
Avg. Class Size
50
Avg. Sections
1