Post–Turing machine equivalence
GPTKB entity
Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
computability theory concept
|
| gptkbp:appliesTo |
models of computation
|
| gptkbp:describes |
equivalence of Post machines and Turing machines
|
| gptkbp:establishedIn |
1930s
|
| https://www.w3.org/2000/01/rdf-schema#label |
Post–Turing machine equivalence
|
| gptkbp:implies |
any function computable by a Turing machine is computable by a Post machine
any function computable by a Post machine is computable by a Turing machine |
| gptkbp:relatedTo |
gptkb:Alan_Turing
gptkb:Emil_Post gptkb:Turing_completeness |
| gptkbp:state |
Post machines and Turing machines have the same computational power
|
| gptkbp:bfsParent |
gptkb:Post_canonical_system
|
| gptkbp:bfsLayer |
8
|