Universal Turing machine: Difference between revisions

Content added Content deleted
No edit summary
m (use a semi-internal WP link)
Line 1:
{{task}}
One of the foundational mathematical constructs behind computer science is the [http[wp://en.wikipedia.org/wiki/Universal_Turing_machineUniversal Turing machine|universal Turing Machine]]. Indeed one way to definitively prove that a language is Turing complete is to implement a universal Turing machine in it.
 
'''The task'''
Retrieved from "https://rosettacode.org/wiki/Universal_Turing_machine"