Turing machine (with unbounded size)

URI: https://gptkb.org/entity/Turing_machine_(with_unbounded_size)
GPTKB entity
Statements (50)
Predicate Object
gptkbp:instanceOf abstract machine
gptkbp:alphabet finite set of symbols
gptkbp:basisFor gptkb:Church-Turing_thesis
modern computer science
gptkbp:canBe deterministic
nondeterministic
gptkbp:compatibleWith physical computer
gptkbp:decision recursive languages
gptkbp:definedIn halting problem
computational complexity classes
decidability
gptkbp:describedBy gptkb:On_Computable_Numbers,_with_an_Application_to_the_Entscheidungsproblem
gptkbp:equivalentTo lambda calculus (in computational power)
mu-recursive functions (in computational power)
gptkbp:formalizes notion of computation
gptkbp:hasComponent finite state control
head
tape
gptkbp:hasModel universal computation
gptkbp:hasTapeDirection left
right
stay
gptkbp:hasTransitionFunction gptkb:government_agency
gptkbp:hasVariant gptkb:multi-tape_Turing_machine
gptkb:nondeterministic_Turing_machine
gptkb:universal_Turing_machine
gptkb:oracle_Turing_machine
https://www.w3.org/2000/01/rdf-schema#label Turing machine (with unbounded size)
gptkbp:includesState finite set of states
gptkbp:input string on tape
gptkbp:introduced gptkb:Alan_Turing
gptkbp:introducedIn 1936
gptkbp:isAbstractedAs gptkb:logic
gptkbp:isUsedToProve complexity class separations
incomputability results
universality of computation
gptkbp:limitation cannot solve undecidable problems
gptkbp:namedAfter gptkb:Alan_Turing
gptkbp:output string on tape
gptkbp:recognizedBy recursively enumerable languages
gptkbp:referencedIn gptkb:Church-Turing_thesis
complexity theory textbooks
computability theory textbooks
gptkbp:SIM any algorithm
gptkbp:studiedIn theoretical computer science
gptkbp:tapeIs infinite
gptkbp:usedIn gptkb:complexity_theory
computability theory
gptkbp:bfsParent gptkb:Boolean_circuits
gptkbp:bfsLayer 4