allfeeds.ai

 

Theory of Computation - Fall 2011  

Theory of Computation - Fall 2011

Theory of Computation - Fall 2011

Author: 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.
Be a guest on this podcast

Language: en-us

Genres: Technology

Contact email: Get it

Feed URL: Get it

iTunes ID: Get it


Get all podcast data

Listen Now...


Wednesday, 1 January, 1000

 

We also recommend:


Facepunch Wuala Podcast
Facepunch Wuala

Sholanda Y. Smith's Podcast
Sholanda Y. Smith

Aftertaste
WPCandy

TEDTalks
TED

Journées Numériques

bnjm.org
bnjm.org

Sound of Symfony
Sound of Symfony

Get Your Tech On
Brady Volpe - The Volpe Firm

Nutanix Community Podcast
Nutanix

History in the eyes of a Southerner
Anthony Allen

Paul Galloway's Podcast
Paul Galloway

Nothing Impossible
Audacy