Great Ideas in Theoretical Computer Science: Computability

Great Ideas in Theoretical Computer Science: Computability

Ryan O'Donnell via YouTube Direct link

Some uncomputable functions

12 of 14

12 of 14

Some uncomputable functions

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

Great Ideas in Theoretical Computer Science: Computability

Automatically move to the next video in the Classroom when playback concludes

  1. 1 15-251: Great Theoretical ideas in Computer Science Lecture 22
  2. 2 What is a computation/algorithm?
  3. 3 Turing's inspiration: computers (usage 2)
  4. 4 The finite control (AKA transition rules)
  5. 5 Formal definition of Turing Machines
  6. 6 Decidable languages
  7. 7 TM programming exercises & tricks
  8. 8 Universal Turing Machine
  9. 9 TM's: good definition of computation?
  10. 10 Church-Turing Thesis: "Any natural / reasonable notion of computation can be simulated by a TM."
  11. 11 Describing Turing Machines
  12. 12 Some uncomputable functions
  13. 13 Does the following program (written in Maple) print out "HELLO WORLD" ?
  14. 14 The Halting Problem is Undecidable

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.