Video details loaded
HomeMIT 18.404J Theory of Computation, Fall 2020Lecture 6: TM Variants, Church-Turing Thesis

Lecture 6: TM Variants, Church-Turing Thesis

1:14:49

Up Next

Lecture 7: Decision Problems for Automata and Grammars

Continue

Description: Quickly reviewed last lecture. Showed that various TM variants are all equivalent to the single-tape model. Discussed the Church-Turing Thesis: Turing machines are equivalent to “algorithms” and model-independence. Introduced notation for encoding objects and describing TMs.

Instructor: Prof. Michael Sipser