Showing papers by "Juris Hartmanis published in 1965"
972 citations
06 Oct 1965
TL;DR: The computational complexity of binary sequences as measured by the rapidity of their generation by multitape Turing machines is investigated and a "translational" method which escapes some of the limitations of earlier approaches leads to a refinement of the established hierarchy.
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
355 citations
06 Oct 1965
TL;DR: The computational complexity of binary sequences as measured by the rapidity of their generation by multitape Turing machines is investigated and a "translational" method which escapes some of the limitations of earlier approaches leads to a refinement of the established hierarchy.
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
219 citations
TL;DR: Two tests for the existence of a linear state assignment for binary input sequential machines are described, based on ``transfer sequences'' and ``ignorance'' computations by means of partitions.
Abstract: This paper describes two tests for the existence of a linear state assignment for binary input sequential machines. The first test is based on ``transfer sequences'' which map one stationary state of a machine onto another stationary state. It is shown that from a minimal transfer sequence of a machine one can read off directly a linear assignment of this machine if one exists. The second test uses ``ignorance'' computations by means of partitions and previously developed results about sequential machine structure.
7 citations