Box 9
Contains 88 Results:
On the Recognition of Primes by Automata, 1968
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
Computational Complexity of One-Tape Turing Machine Computations, 1968
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
Automata-Based Computational Complexity, 1969
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
On the Complexity of Undecidable Problems in Automata Theory, 1969
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
Two Memory Bounds for the Recognition of Primes by Automata, 1969
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
What Makes Some Language Theory Problems Undecidable, 1970
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
A Note on One-Way and Two-Way Automata, 1970
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
On Non-Determinacy in Simple Computing Devices, 1971
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
Size Arguments in the Study of Computation Speeds, 1971
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.
The Use of Lists in the Study of Undecidable Problems in Automata Theory, 1971
Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.