|
gptkbp:instanceOf
|
gptkb:computational_property
|
|
gptkbp:appliesTo
|
gptkb:programming_language
abstract machines
computational systems
|
|
gptkbp:category
|
gptkb:theoretical_computer_science
computability
|
|
gptkbp:contrastsWith
|
Turing incompleteness
|
|
gptkbp:describedYear
|
1936
|
|
gptkbp:example
|
gptkb:JavaScript
gptkb:Python
gptkb:lambda_calculus
gptkb:Post–Turing_machine
gptkb:Brainfuck
C
SQL (with recursion)
|
|
gptkbp:firstDescribed
|
gptkb:Alan_Turing
|
|
gptkbp:implies
|
can compute any computable function
|
|
gptkbp:meaning
|
can simulate a Turing machine
|
|
gptkbp:namedAfter
|
gptkb:Alan_Turing
|
|
gptkbp:nonExamples
|
gptkb:finite_automata
regular expressions
context-free grammars
|
|
gptkbp:relatedTo
|
gptkb:Church–Turing_thesis
computability theory
|
|
gptkbp:requires
|
conditional branching
ability to change state
arbitrary memory
|
|
gptkbp:usedIn
|
gptkb:theoretical_computer_science
programming language theory
|
|
gptkbp:bfsParent
|
gptkb:Alan_Mathison_Turing
|
|
gptkbp:bfsLayer
|
4
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Turing completeness
|