Universal Turing machine: Difference between revisions
Content added Content deleted
m (Updated description and link for Fōrmulæ solution) |
m (added a comment to the task's preamble.) |
||
Line 2:
One of the foundational mathematical constructs behind computer science
is the [[wp:Universal Turing machine|universal Turing Machine]].
(Alan Turing introduced the idea of such a machine in 1936–1937.)
Indeed one way to definitively prove that a language
Line 9 ⟶ 12:
;Task:
Simulate such a machine capable
of taking the definition of any other Turing machine and executing it.
| |||