Questions about Turing machines, a theoretical model of mechanical computation capable of simulating any computer program.
The classic paper that started it all.
On Computable Numbers, with an application to the Entscheidungsproblem
Stack Exchange network consists of 180 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack ExchangeTeams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
Learn moreQuestions about Turing machines, a theoretical model of mechanical computation capable of simulating any computer program.
The classic paper that started it all.
On Computable Numbers, with an application to the Entscheidungsproblem
created |
10 years, 2 months ago by Ran G. |
viewed |
69 times |
active |
7 years, 10 months ago |
editors |
1 |
Your privacy
By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.