Making a Computer Turing Complete
Offered By: Ben Eater via YouTube
Course Description
Overview
Explore the concept of Turing completeness and its significance in computing through this 18-minute video. Delve into the world of Turing Machines and Lambda Calculus, understanding how they define the class of "computable problems." Discover the minor modifications required to transform the 8-bit breadboard computer into a Turing complete machine. Learn about the fundamental capabilities that make a computer truly functional and gain insights into the theoretical foundations of computation.
Syllabus
Intro
What should a computer do
The Turing machine
Lambda calculus
Conclusion
Taught by
Ben Eater
Related Courses
Programming Languages ⅠKorea Advanced Institute of Science and Technology via Coursera Meaning Representation for Natural Language Understanding - Mariana Romanyshyn - ODSC Europe 2019
Open Data Science via YouTube Propositions as Types
Strange Loop Conference via YouTube The Road to Akka Cluster, and Beyond
Strange Loop Conference via YouTube Fun with the Lambda Calculus
GOTO Conferences via YouTube