PODCAST
Theory of Computation - Fall 2011
by Dan Gusfield
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.
No episodes available yet.
We're indexing this podcast's transcripts for the first time — this can take a minute or two. We'll show results as soon as they're ready.
No matches for "" in this podcast's transcripts.
No topics indexed yet for this podcast.
Loading reviews...
ABOUT THIS SHOW
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.
HOSTED BY
Dan Gusfield
Loading similar podcasts...
Frequently Asked Questions
How many episodes does Theory of Computation - Fall 2011 have?
Theory of Computation - Fall 2011 currently has 0 episodes available on PodParley. New episodes are automatically indexed when they're published to the podcast feed.
What is Theory of Computation - Fall 2011 about?
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...
How often does Theory of Computation - Fall 2011 release new episodes?
Theory of Computation - Fall 2011 is no longer actively publishing new episodes, but the existing catalog remains available.
Where can I listen to Theory of Computation - Fall 2011?
You can listen to Theory of Computation - Fall 2011 on PodParley by clicking any episode. We provide an embedded audio player for direct listening.
Who hosts Theory of Computation - Fall 2011?
Theory of Computation - Fall 2011 is created and hosted by Dan Gusfield.
URL copied to clipboard!