The DOI matches its Crossref record.
Classes of predictably computable functions
Abstract
In this paper we study a sequence of classes of computable functions for which a prediction of the complexity of the calculation may be made in a comparatively simple fashion.The class of recursive functions is accepted as being the class of just those functions for which there is a mechanical procedure for obtaining the values from the arguments.However, this class, since it involves all computations, must involve arbitrarily complex computations.Various more restricted classes of functions have been proposed as being somehow more easily computable, but the greater ease of computation has largely been left on the level of intuition.The notable exception to this is the class F of functions computable(2) by finite automata.However, this class is too severely restricted; it does not even include multiplication.We present a hierarchy of more inclusive classes of functions, each defined as the class of functions whose computational complexity is "predictable" by a function in the preceding class.It is known that the class F of numerical functions computable by finite automata includes addition and is closed under explicit transformations^) and composition.In particular then, it contains the linear functions(4).This class, F, is taken as a basic class since these functions are computed "as swiftly as possible;" as soon as the input has been scanned, the output is printed.To get a larger class, we consider the class of functions computable (in binary notation) by Turing machines which use an amount of tape bounded by a simpler function, namely one in F. We call this new class Ft.Continuing in this way, we define F; to be the class of functions computable by Turing machines which use in their computations an amount of tape bounded by a function in Ft-i.That is, we
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
Cited by
A Machine-Independent Theory of the Complexity of Recursive Functions
Blum, M. (1967) · Journal of the ACM · doi:10.1145/321386.321395 · Cited by 829
On the Structure of Polynomial Time Reducibility
Ladner, R. E. (1975) · Journal of the ACM · doi:10.1145/321864.321877 · Cited by 781
Computability: An introduction to recursive function theory
Cutland, N. (1980) · doi:10.1017/cbo9781139171496 · Cited by 206
Metadata
- Authors
- Ritchie, R. W.
- Venue
- Transactions of the American Mathematical Society
- Publisher
- American Mathematical Society (AMS)
- Published
- 1963
- Volume
- 106
- Issue
- 1
- Pages
- 139-173
- ISSN
- 0002-9947 (ISSN-L)
- 1088-6850
- OpenAlex
- W1999590237
- Cited by
- 248
- References
- 0
- FWCI
- 5.83
- Type
- journal article
- Language
- en
- Open access
- closed
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: Classes of predictably computable functions. https://app.cochat.ai/papers/10.1090/s0002-9947-1963-0158822-2
- The paper
- Ritchie, R. W. (1963). Classes of predictably computable functions. Transactions of the American Mathematical Society. https://doi.org/10.1090/s0002-9947-1963-0158822-2
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.