Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 1,006

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

On the computational complexity of algorithms

Open access
Hartmanis, J., Stearns, R. E.·1965·Transactions of the American Mathematical Society

Abstract

I. Introduction.In his celebrated paper [1], A. M. Turing investigated the computability of sequences (functions) by mechanical procedures and showed that the setofsequencescanbe partitioned into computable and noncomputable sequences.One finds, however, that some computable sequences are very easy to compute whereas other computable sequences seem to have an inherent complexity that makes them difficult to compute.In this paper, we investigate a scheme of classifying sequences according to how hard they are to compute.This scheme puts a rich structure on the computable sequences and a variety of theorems are established.Furthermore, this scheme can be generalized to classify numbers, functions, or recognition problems according to their computational complexity.The computational complexity of a sequence is to be measured by how fast a multitape Turing machine can print out the terms of the sequence.This particular abstract model of a computing device is chosen because much of the work in this area is stimulated by the rapidly growing importance of computation through the use of digital computers, and all digital computers in a slightly idealized form belong to the class of multitape Turing machines.More specifically, if Tin) is a computable, monotone increasing function of positive integers into positive integers and if a is a (binary) sequence, then we say that a is in complexity class ST or that a is T-computable if and only if there is a multitape Turing machine 3~ such that 3~ computes the nth term of a. within Tin) operations.Each set ST is recursively enumerable and so no class ST contains all computable sequences.On the other hand, every computable a is contained in some complexity class ST.Thus a hierarchy of complexity classes is assured.Furthermore, the classes are independent of time scale or of the speed of the components from which the machines could be built, as there is a "speed-up" theorem which states that ST = SkT for positive numbers k.As corollaries to the speed-up theorem, there are several limit conditions which establish containment between two complexity classes.This is contrasted later with the theorem which gives a limit condition for noncontainment.One form of this result states that if (with minor restrictions)

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1090/s0002-9947-1965-0170805-7

Cites

5 of 5 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 5 references

Research works printed but not linked: 2

  1. J. Hartmanis and R. E. Stearns, Computational complexity of recursive sequences, Proc. Fifth Annual Sympos. on Switching Theory and Logical Design, Princeton, N. J. 1964. · doi:10.1109/swct.1964.6
  2. Rabin, Michael O., 1963, Real time computation, Israel J. Math., 1, 203, 10.1007/BF02759719 · doi:10.1007/bf02759719

Cited by

See all 1,006

Metadata

Authors
Hartmanis, J., & Stearns, R. E.
Venue
Transactions of the American Mathematical Society
Published
1965
Volume
117
Issue
0
Pages
285-306
ISSN
  • 0002-9947 (ISSN-L)
  • 1088-6850
OpenAlex
W2125495920
Cited by
1,006
References
5
FWCI
19.82
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: On the computational complexity of algorithms. https://app.cochat.ai/papers/10.1090/s0002-9947-1965-0170805-7
The paper
Hartmanis, J., & Stearns, R. E. (1965). On the computational complexity of algorithms. Transactions of the American Mathematical Society. https://doi.org/10.1090/s0002-9947-1965-0170805-7

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.