DocumentCode
3263824
Title
Hierarchies of memory limited computations
Author
Stearns, R.E. ; Hartman, J. ; Lewis, P.M., II
fYear
1965
fDate
6-8 Oct. 1965
Firstpage
179
Lastpage
190
Abstract
This paper investigates the computational complexity of binary sequences as measured by the rapidity of their generation by multitape Turing machines. A "translational" method which escapes some of the limitations of earlier approaches leads to a refinement of the established hierarchy. The previous complexity classes are shown to possess certain translational properties. An related hierarchy of complexity classes of monotonic functions is examined
Keywords
Binary sequences; Computational complexity; Turing machines;
fLanguage
English
Publisher
ieee
Conference_Titel
Switching Circuit Theory and Logical Design, 1965. SWCT 1965. Sixth Annual Symposium on
Conference_Location
Ann Arbor, MI, USA
Type
conf
DOI
10.1109/FOCS.1965.11
Filename
5397244
Link To Document