Godel for Goldilocks: Godel's First Incompleteness Theorem by Theory of Computation - Fall 2011 | Podchaser

Episode from the podcastTheory of Computation - Fall 2011

Godel for Goldilocks: Godel's First Incompleteness Theorem

Released Thursday, 1st May 2014

Good episode? Give it some love!

Godel for Goldilocks: Godel's First Incompleteness Theorem

Godel for Goldilocks: Godel's First Incompleteness Theorem

Thursday, 1st May 2014

Good episode? Give it some love!

Rate Episode

List

Podchaser Pro

Rate

List

Get this podcast via API

From The Podcast

This is a rigorous undergraduate course on the Theory of Computation, using the classic text "Introduction to the Theory of Computation" by Michael Sipser. The course covers machine models and languages defined by Finite State Machines, Context-Free Languages, and Turing Machines. There are four major theorems (and their uses) that we will study during this course, providing complete proofs: the pumping Lemma for regular languages, used to show that there are languages that are not regular; the existence of a Universal Turing Machine; undecidability of the Halting problem; and Cook's theorem that NP-complete problems exist. In addition to these major results, and other results, a central goal of the course is to increase student's skill level in understanding and writing rigorous mathematical proofs.

Join Podchaser to...

Rate podcasts and episodes
Follow podcasts and creators
Create podcast and episode lists
& much more

Do you host or manage this podcast?
Claim and edit this page to your liking.

,

Podchaser is the ultimate destination for podcast data, search, and discovery. Learn More