Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:alphabet |
finite set of symbols
|
| gptkbp:category |
automata theory
|
| gptkbp:computationalPower |
equivalent to single-tape Turing machine
|
| gptkbp:describedBy |
gptkb:Turing's_1936_paper_'On_Computable_Numbers'
|
| gptkbp:generalizes |
gptkb:single-tape_Turing_machine
|
| gptkbp:hasComponent |
multiple tape heads
multiple tapes |
| gptkbp:hasInputTape |
yes
|
| gptkbp:hasOutputTape |
optional
|
| gptkbp:hasTransitionFunction |
based on current state and tape symbols
|
| https://www.w3.org/2000/01/rdf-schema#label |
multi-tape Turing machine
|
| gptkbp:includesState |
finite set of states
|
| gptkbp:introduced |
gptkb:Alan_Turing
|
| gptkbp:introducedIn |
1936
|
| gptkbp:SIM |
gptkb:single-tape_Turing_machine
|
| gptkbp:simulatedBy |
gptkb:single-tape_Turing_machine
|
| gptkbp:simulationOverhead |
polynomial time
|
| gptkbp:usedFor |
algorithm design
complexity analysis |
| gptkbp:usedIn |
theoretical computer science
|
| gptkbp:bfsParent |
gptkb:Technical_Machine
|
| gptkbp:bfsLayer |
4
|