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 1 video

Videos Mentioning Turing machine

Scott Aaronson on Computational Complexity Theory and Quantum Computers

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.