80-611 Computability and Incompleteness

Units: 12.0 Department: Philosophy Cross-listed: 80-311 Related URLs: http://www.hss.cmu.edu/philosophy The 1930's witnessed two revolutionary developments in mathematical logic: first, Gvdel's famous incompleteness theorems, which demonstrate the limitations of formal mathematical reasoning, and second, the formal analysis of the notion of computation in the work of Turing, Gvdel, Herbrand, Church, Post, Kleene, and others, together with Turing's results on the limits of computation. This course will cover these developments, and related results in logic and the theory of computability. Prerequisites: 80-210 or 80-211, or an equivalent course in Mathematics or Computer Science. 12 units

Popularity index Rank for this semester: #1278 Rank in this department: #37   Students also scheduled 82-103 Elementary French I Online 15-441 Computer Networks 15-251 Great Theoretical Ideas in Computer...

Spring 2005 times

Sec	Time	Day	Instructor	Location
A	10:30 - 11:50 am	T	Avigad	PH 100
		R	Avigad	PH 100