Overview
Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This lecture introduces Turing machines as a formal model of computation. It covers machine construction, algorithm and language definitions, computation on inputs, and deciders for decision problems, with examples including palindrome recognition.
Syllabus
Introduction
Formalization
Turing Thesis
Extended Churchturing Thesis
Turing Machines
Turing Machine Example
Algorithm Definition
Mathematical Definition
Taught by
Ryan O'Donnell