Course Schedule and Catalog
Course Schedule - Spring Semester 2007
Meeting location information can now be found on student schedules in ESTHER (for students) or on the Course Roster in ESTHER (for faculty and instructors).Additional information available here.
Meeting location information can now be found on student schedules in ESTHER (for students) or on the Course Roster in ESTHER (for faculty and instructors).Additional information available here.
PHIL 357 001 (CRN: 21569)
INCOMPL, UNDECIDED&COMPUTBLTY
Long Title: INCOMPLETENESS, UNDECIDABILITY, AND COMPUTABILITY
Department: Philosophy
Instructor: Grandy, Richard E.
Meeting: 10:00AM - 10:50AM MWF (8-JAN-2007 - 25-APR-2007)
Part of Term: Full Term
Grade Mode: Standard Letter
Course Type: Lecture
Distribution Group: Distribution Group III
Method of Instruction: Face to Face
Credit Hours: 3
Course Syllabus:
Section Max Enrollment: 100
Section Enrolled: 12
Enrollment data as of: 17-MAY-2024 11:22PM
Description: Proof of Godel's Incompleteness Theorems for number theory in several forms and by various methods, as well as development of several definitions of computability for number-theoretic functions, which are then shown to be equivalent. Includes proof of the unsolvability of the Halting Problem and analysis of Church's thesis, as well as exploration of the extension of the concept of computability to real-valued functions.