|
gptkbp:instanceOf
|
gptkb:logic
gptkb:theoretical_computer
|
|
gptkbp:category
|
gptkb:Automata_theory
gptkb:Theoretical_computer_science
Models of computation
|
|
gptkbp:describedBy
|
gptkb:On_Computable_Numbers,_with_an_Application_to_the_Entscheidungsproblem
|
|
gptkbp:describedYear
|
1936
|
|
gptkbp:hasProperty
|
can interpret encoded instructions
can simulate any algorithm
programmable
|
|
gptkbp:influenced
|
theory of computation
development of modern computers
|
|
gptkbp:input
|
description of another Turing machine
input for simulated machine
|
|
gptkbp:inventedBy
|
gptkb:Alan_Turing
|
|
gptkbp:isAbstract
|
true
|
|
gptkbp:output
|
output of simulated machine
|
|
gptkbp:relatedTo
|
gptkb:Church–Turing_thesis
gptkb:Technical_Machine
gptkb:Turing_completeness
|
|
gptkbp:SIM
|
any Turing machine
|
|
gptkbp:symbol
|
U
|
|
gptkbp:usedIn
|
gptkb:theoretical_computer_science
gptkb:complexity_theory
computability theory
|
|
gptkbp:bfsParent
|
gptkb:Turing_machine_(with_unbounded_size)
|
|
gptkbp:bfsLayer
|
5
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
universal Turing machine
|