Statements (30)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science concept
|
| gptkbp:basisFor |
gptkb:Church-Turing_thesis
algorithm analysis computational models |
| gptkbp:describes |
abstract machines
|
| gptkbp:example |
gptkb:lambda_calculus
gptkb:register_machine Technical Machine finite automaton pushdown automaton cellular automaton |
| gptkbp:field |
theoretical computer science
|
| gptkbp:formalized_by |
gptkb:logic
gptkb:set_theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Model of Computation
|
| gptkbp:notableContributor |
gptkb:Alan_Turing
gptkb:Alonzo_Church gptkb:Emil_Post gptkb:Stephen_Kleene |
| gptkbp:originatedIn |
1930s
|
| gptkbp:relatedTo |
gptkb:complexity_theory
automata theory computability theory |
| gptkbp:studies |
how efficiently problems can be solved
what problems can be solved by computation |
| gptkbp:usedFor |
studying computability
analyzing computational complexity |
| gptkbp:bfsParent |
gptkb:MOC
gptkb:MoC |
| gptkbp:bfsLayer |
6
|