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.
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