Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
Shepherdson–Sturgis register machine theorem
|
| gptkbp:concerns |
Turing machines
register machines |
| gptkbp:field |
computability theory
theoretical computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
Shepherdson–Sturgis theorem
|
| gptkbp:namedAfter |
gptkb:Howard_Sturgis
gptkb:John_Shepherdson |
| gptkbp:publicationYear |
1963
|
| gptkbp:publishedIn |
gptkb:Journal_of_the_ACM
|
| gptkbp:state |
every partial recursive function can be computed by a register machine
|
| gptkbp:bfsParent |
gptkb:John_Shepherdson
|
| gptkbp:bfsLayer |
7
|