The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
A Machine-Independent Theory of the Complexity of Recursive Functions
Open accessAbstract
The number of steps required to compute a function depends, in general, on the type of computer that is used, on the choice of computer program, and on the input-output code. Nevertheless, the results obtained in this paper are so general as to be nearly independent of these considerations. A function is exhibited that requires an enormous number of steps to be computed, yet has a “nearly quickest” program: Any other program for this function, no matter how ingeniously designed it may be, takes practically as many steps as this nearly quickest program. A different function is exhibited with the property that no matter how fast a program may be for computing this function another program exists for computing the function very much faster.
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.
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
On the computational complexity of algorithms
Hartmanis, J., & Stearns, R. E. (1965) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1965-0170805-7 · Cited by 1,006
Classes of predictably computable functions
Ritchie, R. W. (1963) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1963-0158822-2 · Cited by 248
Real-Time Computation and Recursive Functions Not Real-Time Computable
Yamada, H. (1962) · IEEE Transactions on Electronic Computers · doi:10.1109/tec.1962.5219459 · Cited by 89
On the Time Required to Perform Multiplication
Winograd, S. (1967) · Journal of the ACM · doi:10.1145/321420.321438 · Cited by 73
Machine Dependence of Degrees of Difficulty
Arbib, M. A., & Blum, M. (1965) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1965-0181538-0 · Cited by 15
Self-citation
Cited by
Relationships between nondeterministic and deterministic tape complexities
Savitch, W. J. (1970) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(70)80006-x · Cited by 1,366
Inductive Inference: Theory and Methods
Angluin, D., & Smith, C. H. (1983) · ACM Computing Surveys · doi:10.1145/356914.356918 · Cited by 887
Zvonkin, A. K., & Levin, L. A. (1970) · Russian Mathematical Surveys · doi:10.1070/rm1970v025n06abeh001269 · Cited by 665
Harman, G. (1999) · doi:10.1093/0198238029.001.0001 · Cited by 409
A Review of Methodological Approaches for the Design and Optimization of Wind Farms
Herbert-Acero, J., Probst, O., Réthoré, P.-E., Larsen, G., & Castillo-Villar, K. (2014) · Energies · doi:10.3390/en7116930 · Cited by 311
Metadata
- Authors
- Blum, M.
- Venue
- Journal of the ACM
- Published
- 1967-04
- Volume
- 14
- Issue
- 2
- Pages
- 322-336
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2089442854
- Cited by
- 829
- References
- 5
- FWCI
- 20.27
- Type
- journal article
- Language
- en
- Open access
- bronze
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: A Machine-Independent Theory of the Complexity of Recursive Functions. https://app.cochat.ai/papers/10.1145/321386.321395
- The paper
- Blum, M. (1967). A Machine-Independent Theory of the Complexity of Recursive Functions. Journal of the ACM. https://doi.org/10.1145/321386.321395
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.