YoVDO

Making a Computer Turing Complete

Offered By: Ben Eater via YouTube

Tags

Theoretical Computer Science Courses Computer Architecture Courses Turing Machines Courses Lambda Calculus Courses

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

Automata Theory
Stanford University via edX
Intro to Theoretical Computer Science
Udacity
Computing: Art, Magic, Science
ETH Zurich via edX
理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX
Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera