4 results
Gödel redux
-
- Journal:
- Behavioral and Brain Sciences / Volume 13 / Issue 4 / December 1990
- Published online by Cambridge University Press:
- 19 May 2011, pp. 675-676
-
- Article
- Export citation
Oscar H. Ibarra. Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata. Journal of computer and system sciences, vol. 5 (1971), pp. 88-117.
-
- Journal:
- The Journal of Symbolic Logic / Volume 39 / Issue 1 / March 1974
- Published online by Cambridge University Press:
- 12 March 2014, pp. 188-189
- Print publication:
- March 1974
-
- Article
- Export citation
P. M. LewisII, R. E. Stearns, and J. Hartmanis. Memory bounds for recognition of context-free and context-sensitive languages. Sixth Annual Symposium on Switching Circuit Theory and Logical Design, University of Michigan, Ann Arbor, Mich., The Institute of Electrical and Electronics Engineers, Inc., New York 1965, pp. 191–202. See Errata, ibid., p. 190.
-
- Journal:
- The Journal of Symbolic Logic / Volume 37 / Issue 3 / September 1972
- Published online by Cambridge University Press:
- 12 March 2014, p. 625
- Print publication:
- September 1972
-
- Article
- Export citation
R. E. Stearns, J. Hartmanis, and P. M. LewisII. Hierarchies of memory limited computations. Sixth Annual Symposium on Switching Circuit Theory and Logical Design, University of Michigan, Ann Arbor, Mich., The Institute of Electrical and Electronics Engineers, Inc., New York 1965, pp. 179–190.
-
- Journal:
- The Journal of Symbolic Logic / Volume 37 / Issue 3 / September 1972
- Published online by Cambridge University Press:
- 12 March 2014, pp. 624-625
- Print publication:
- September 1972
-
- Article
- Export citation