This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
Computational complexity of recursive sequnces
November 11-November 13
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, pp.82-90, 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design, 1964
Usage of this product signifies your acceptance of the Terms of Use.