Course Catalog - 2018-2019

     

PHIL 357 - INCOMPL, UNDECIDED&COMPUTBLTY

Long Title: INCOMPLETENESS, UNDECIDABILITY, AND COMPUTABILITY
Department: Philosophy
Grade Mode: Standard Letter
Language of Instruction: Taught in English
Course Type: Lecture
Distribution Group: Distribution Group III
Credit Hours: 3
Restrictions:
Must be enrolled in one of the following Level(s):
Undergraduate Professional
Visiting Undergraduate
Undergraduate
Description: Proofs 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. Frequent misunderstandings and misrepresentations of the theorems are analyzed.