1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design (1964)

Nov. 11, 1964 to Nov. 13, 1964

pp: 82-90

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SWCT.1964.6

ABSTRACT

In this paper we investigate how numbers, functions, and sequences can be classified according to their computational complexity. The computational complexity is measured by how fast the number or function can be computed by a multitape computer (Turing machine). It is shown that by means of this measure the computational complexity of numbers and functions can be submitted to rigorous mathematical study and a number of results are obtained.

INDEX TERMS

CITATION

J. Hartmanis,
R. E. Stearns,
"Computational complexity of recursive sequnces",

*1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design*, vol. 00, no. , pp. 82-90, 1964, doi:10.1109/SWCT.1964.6CITATIONS