Turing Complete – Computerphile

What does it mean for something to be Turing Complete A Turing-complete language (also called a universal language) is one where you can compute anything that any other computational method can compute. Learn more? Professor Brailsford explains.

Turing Machine Primer: youtu.be/DILF8usqp7M
Turing Machines Explained: youtu.be/dNRDvLACg5Q
Chomsky Hierarchy: youtu.be/224plb3bCog
What on Earth is Recursion?: youtu.be/Mv9NEXX1VHc

Facebook
Twitter

This video was filmed and edited by Sean Riley.

Computer Science at the University of Nottingham: bit.ly/nottscomputer

Computerphile is a sister project to Brady Haran’s Numberphile. More at bradyharan.com