Turing machine
Software / App
A theoretical model of computation proposed by Alan Turing, used to define complexity classes like P and NP, and as the basis for Busy Beaver numbers.
Mentioned in 2 videos
Save the 2 videos on Turing machine to your own pod.
Sign up free to keep building your knowledge base on Turing machine as more episodes are added.
Videos Mentioning Turing machine
Scott Aaronson on Computational Complexity Theory and Quantum Computers
Y Combinator
A theoretical model of computation proposed by Alan Turing, used to define complexity classes like P and NP, and as the basis for Busy Beaver numbers.
Why Physics Needs Counterfactuals | Chiara Marletto
Closer To Truth
A theoretical model of computation used as a parallel to constructor theory, highlighting the concept of universal transformation.