Box 9
Container
Contains 88 Results:
Computational Complexity of One-Tape Turing Machine Computations, 1968
unspecified — Box: 9, Folder: 12
Dates:
1968
On the Complexity of Undecidable Problems in Automata Theory, 1969
unspecified — Box: 9, Folder: 14
Dates:
1969
Two Memory Bounds for the Recognition of Primes by Automata, 1969
unspecified — Box: 9, Folder: 15
Dates:
1969
What Makes Some Language Theory Problems Undecidable, 1970
unspecified — Box: 9, Folder: 16
Dates:
1970
Size Arguments in the Study of Computation Speeds, 1971
unspecified — Box: 9, Folder: 19
Dates:
1971
The Use of Lists in the Study of Undecidable Problems in Automata Theory, 1971
unspecified — Box: 9, Folder: 20
Dates:
1971