Back to Results
First PageMeta Content
Computer science / Alan Turing / Computational complexity theory / Read-only Turing machine / Non-deterministic Turing machine / Turing machine / Theory of computation / Theoretical computer science


Universal Turing Machine A Turing machine that is able to simulate any other Turing machine is called a Universal Turing machine. The concept of the Turing machine is based on the idea of a person executing a well-define
Add to Reading List

Document Date: 2015-03-08 13:02:07


Open Document

File Size: 111,81 KB

Share Result on Facebook
UPDATE