Bounded action machines II: The basic structure of Tapeless computers
Explore this paper's citation graph
Summary
The paper shows that the basic structure of “conventional computers” is a consequence of the existence of control registers, and these results are generalized to computers with one-step indirect addressing.
- Type
- article
- Published
- 1972-09-01
- Cited by
- 1
- References
- 2
- OpenAlex
- https://openalex.org/W27471873
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:31922483
Keywords
Axiom, Bounded function, Computer science, Simple (philosophy), Action (physics)
References
Cited by
Related papers
- The [0-Simple] Simple Subsemigroups of Nonnegative Matrices
- Fundamental relations in simple and 0-simple semihypergroups of small size
- Book Review: IV. Pastorial — Practical Studies: Simple Sermons for Times like These, Simple Sermons on Evangelistic Themes, Simple Talks for Christian Workers, Simple Sermons on Prophetic Themes, Simple Sermons about Jesus Christ, Simple Sermons on Heaven, Hell, and Judgment, Simple Sermons on the Ten Commandments, Simple Sermons for a Sinful Age, Simple Sermons on the Seven Churches of Revelation
- An improved formulation of some theorems and axioms in the axiomatic foundation of the Hilbert space structure of quantum mechanics