More on diagonalization in preparation for proving, by diagonalization, that ATM is not decidable. Proof that the set of all Turing Machines is countable.

L14: More Diagonalization; Proof that Turing machines are countable

Failed to load content!

The page you were looking for was moved or doesn't exist.


Previous 30 days

Today

Previous 7 days

The podcast {{podcastName}} is embedded on this page from an open {{RSSLink}}. All files, descriptions, artwork and other metadata from the RSS-feed is the property of the podcast owner and not affiliated with or validated by Podplay.

The podcast {{podcastName}} is distributed by Podplay. Here you find the podcasts {{RSSLink}}.

Play latest

Resume

More

Popular podcasts

{{title}} | {{podcastTitle}} | Podplay

Page not found

An error has occurred

Find and listen to your favourite podcasts at Podplay.

Podplay

{{title}} | Listen at Podplay

Find and listen to your favourite podcasts at Podplay - Your home for podcasts.

Podplay | Your Home for Podcasts

Account settings - Data

My account – delete account

Account settings - settings

My account - Settings

My account

My account - password

Something went wrong, please try again. If the problem persists, please contact us.

Go to start page

Click the button below to request your data. The data will be sent to the email associated with your account.

You have already requested your data. You must wait before requesting again.

A download link will be sent to your email when the file has been created.

Request your data

Click below to delete your account. Note that all information associated with your account, such as which podcasts you follow and listening history, will also be deleted.

Delete Account

Update account information

You have entered wrong password. Please try again.

Update password

You need to enter your current password to make changes on your profile.

Profile name is part of your public profile.

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.