Hartmanis and Stearns: computational complexity of algorithms

What changed

Formalized time-bounded multitape computation and derived hierarchy and simulation results.

Scientific scope

The record is the exact two-author 1965 Transactions of the AMS paper. Its definitions and theorems use the machine and time measures stated there; later complexity classes, reductions, completeness theory and machine-robust refinements remain separate.

Evidence

The linked sources identify this contribution and its scope. WRS has not independently reconstructed the scientific claims. The record is the exact two-author 1965 Transactions of the AMS paper. Its definitions and theorems use the machine and time measures stated there; later complexity classes, reductions, completeness theory and machine-robust refinements remain separate.

Contributors

• J. Hartmanis · SCIENCE: Named source author of the scoped work; individual effort shares are not measured.
• R. E. Stearns · SCIENCE: Named source author of the scoped work; individual effort shares are not measured.

• AMS full text of computational-complexity paper
• Crossref metadata for computational-complexity paper

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction