Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
Turing machines
primitive recursive functions general recursive functions |
| gptkbp:field |
gptkb:theoretical_computer_science
gptkb:logic |
| gptkbp:namedAfter |
gptkb:Howard_Sturgis
gptkb:John_Shepherdson |
| gptkbp:publicationYear |
1963
|
| gptkbp:publishedIn |
gptkb:Journal_of_the_Association_for_Computing_Machinery
|
| gptkbp:relatedTo |
gptkb:Church–Turing_thesis
gptkb:Turing_completeness gptkb:register_machine |
| gptkbp:state |
Every partial recursive function can be computed by a register machine
|
| gptkbp:bfsParent |
gptkb:register_machine
|
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
Shepherdson–Sturgis
|