The DOI matches its Crossref record.
Computational Work and Time on Finite Machines
Open accessAbstract
Measures of the computational work and computational delay required by ms chines to compute functions are given.Exchange inequalities are developed for random acces~ tape, and drum machines to show that product inequalities between storage and time, numbe of drum tracks and time, number of bits in an address and time, etc., must be satisfied to corn pute finite functions on bounded machines.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“However, a form of recurrence can be achieved without this structure: any finite sequence of operations by a network with feedback loops can be mimicked by a suitable feedforward network with enough layers.”
From Consciousness in Artificial Intelligence: Insights from the Science of Consciousness (2023) · cites this paper as Savage 1972
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 7
- MINSKY M. Form and content in computer science. J. ACM 17 2 (Apr. 1970) 197-215. 10.1145/321574.321575 MINSKY M. Form and content in computer science. J. ACM 17 2 (Apr. 1970) 197-215. 10.1145/321574.321575 · DOI
- SAVAGE J. E. Three measures of decoder complexity. IBM J. Res. Devel. 15 4 (July 1970) 417-425. SAVAGE J. E. Three measures of decoder complexity. IBM J. Res. Devel. 15 4 (July 1970) 417-425. · DOI
- SAVAGE J. E. The complexity of decoders--Part II: Computational work and decoding time. IEEE Trans. on Information Theory IT-17 1 (Jan. 1971). 77-85. SAVAGE J. E. The complexity of decoders--Part II: Computational work and decoding time. IEEE Trans. on Information Theory IT-17 1 (Jan. 1971). 77-85. · DOI
- WINOGRAD S. On the time required to perform addition. J. ACM 12 2 (Apr. 1965) 277- 285. 10.1145/321264.321279 WINOGRAD S. On the time required to perform addition. J. ACM 12 2 (Apr. 1965) 277- 285. 10.1145/321264.321279 · DOI
- WINOGRAD S. On the time required to perform multiplication. J. ACM 15 4 (Oct. 1967) 793-802. 10.1145/321420.321438 WINOGRAD S. On the time required to perform multiplication. J. ACM 15 4 (Oct. 1967) 793-802. 10.1145/321420.321438 · DOI
- Switching HARRISON, M. A., 1965, Ch., 6, 7
- YOUNGER D.H. Recognition and parsing of context-free languages in time n 3. Information and Control I0 2 (1967) 189-208. YOUNGER D.H. Recognition and parsing of context-free languages in time n 3. Information and Control I0 2 (1967) 189-208. · DOI · Paper page
Cited by
Consciousness in Artificial Intelligence: Insights from the Science of Consciousness
Butlin, P., Long, R., Elmoznino, E., Bengio, Y., Birch, J., Constant, A., Deane, G., Fleming, S. M., Frith, C., Ji, X., et al. (2023) · arXiv · doi:10.48550/arxiv.2308.08708 · Cited by 196
Metadata
- Authors
- Savage, J. E.
- Affiliations
- Brown University (US)
- Corresponding author
- Savage, J. E.
- Venue
- Journal of the ACM
- Published
- 1972-10
- Volume
- 19
- Issue
- 4
- Pages
- 660-674
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W1982704699
- Cited by
- 105
- References
- 0
- Citations by year
- 2026: 1 · 2023: 1 · 2022: 1 · 2021: 1 · 2019: 29 · 2018: 2 · 2014: 4
- FWCI
- 5.37
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Journal of the ACM (publishedVersion)
- NASA STI Repository (National Aeronautics and Space Administration) (submittedVersion)
- Funders
- National Science Foundation
- National Aeronautics and Space Administration
- Brown University
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Physical Sciences › Computer Science › Computational Theory and Mathematics › semigroups and automata theory
- Keywords
- processing delay, drum machines
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computational Work and Time on Finite Machines. https://app.cochat.ai/papers/10.1145/321724.321731
- The paper
- Savage, J. E. (1972). Computational Work and Time on Finite Machines. Journal of the ACM. https://doi.org/10.1145/321724.321731
