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
Computer ArchitecturePrinceton University via Coursera Introduction to Computer Architecture
Carnegie Mellon University via Independent Build a Modern Computer from First Principles: From Nand to Tetris (Project-Centered Course)
Hebrew University of Jerusalem via Coursera 计算机系统基础(一) :程序的表示、转换与链接
Nanjing University via Coursera Computer Architecture
Indian Institute of Technology Madras via Swayam