The Community for Technology Leaders
RSS Icon
Subscribe
Nov. 11, 1964 to Nov. 13, 1964
pp: 82-90
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.
CITATION
J. Hartmanis, R. E. Stearns, "Computational complexity of recursive sequnces", FOCS, 1964, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 1964, pp. 82-90, doi:10.1109/SWCT.1964.6
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool