Learn EDR Internals: Research & Development From The Masters
Get 20% off all career paths from fullstack to AI
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 models of computation and examines how tape organization and random access affect time and space complexity. It uses palindrome checking, sorting, and maximum-finding to discuss the realism of computational models.
Syllabus
Introduction
Models of Computation
Turing Machines
Historical Advantages
MultiTape Turing Machines
Objections
Multitapeturing
Memory
TimeSpace Bound
Random Access Turing Machine
Log In Space
Im Gonna Find Max
Taught by
Ryan O'Donnell