AI, Data Science & Cloud Certificates from Google, IBM & Meta
Learn Excel and Financial Modeling the Way Finance Teams Actually Use Them
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 mathematical model for computation and algorithms, explaining their states, tape, transitions, and subroutines. It also discusses decision problems, formal languages, and the Church–Turing thesis.
Syllabus
Intro
Problem: A mapping of instances to solutions.
Downsides as a formal definition
Interpreters
Inventing TM programming language
Defining Turing Machines
OFFICIAL PICTURE of a Turing Machine
OFFICIAL DEFINITION of Turing Machines
Some TM subroutines and tricks
Taught by
Ryan O'Donnell