John Case
- 1 LEE, C.Y. A Turing machine which prints its own code script. In Proc. Syrup. on the Mathematical Theory of Automata, Polytechnic Press, Brooklyn, N. Y., 1963, pp. 155-164.Google Scholar
- 2 MY~ILL, J. Abstract theory of self-reproduction. In Views on General Systems Theory, M. D. Mesarovic, Ed., Wiley, New York, 1964, pp. 106-118.Google Scholar
- 3 ROGERS, H., JR. Computing degrees of unsolvability. Math. Ann. 138 (1959), 125-140.Google Scholar
- 4 LEWIS, F. D. The classification of unsolvable problems in automata theory. Tech. Rep. 70-49, Computer Sci. Dept, Cornell U., Ithaca, N. Y., 1970.Google Scholar
- 5 ROGERS, H., JR. Theory of Recursive Functions and Effective Computability. McGraw- Hill, New York, 1967. Google Scholar
- 6 THATCHER, J.W. The construction of a self-describing Turing machine. In Proc. Symp. on the Mathematical Theory of Automata, Polytechnic Press, Brooklyn, N. Y., 1963, pp. 165-171.Google Scholar
- 7 MINSKY, M. Matter, mind, and models. In Proc. IFIP Cong. I965, Vol. 1, North Holland Pub. Co., Amsterdam, pp. 45-49.Google Scholar
- 8 WANG, H. A variant to Turing's theory of computing machines. J. ACM 4 (1967), 63-92. Google Scholar
- 9 MYHILL, J. Creative sets, Zeitschr Math. Logik Grundl. Math. 1 (1955), 97-108.Google Scholar
- 10 KLEENE, S.C. Introduction to Metamathematics. Van Nostrand, Princeton, N. J., 1952.Google Scholar
- 11 G6DEL, K. Uber formal unentscheidbare si~tze derPrincipiaMathematica undverwandter systeme I. Monatsh. Math. Phys. 38 (1931), 173-198.Google Scholar
Index Terms
- A Note on Degrees of Self-Describing Turing Machines
Recommendations
Self-describing Turing machines
After a sketchy historical account on the question of self-describeness and self-reproduction, and after discussing the definition of suitable encodings for self-describeness, we give the construction of several self-describing Turing machines, namely ...
A note on one-pebble two-dimensional Turing machines
This paper investigates a relationship among the accepting powers of deterministic, nondeterministic, and alternating one-pebble two-dimensional Turing machines, and shows that 1. nondeterminism are more powerful than determinism for o(log n) space-...
Self-describing Turing machines
After a sketchy historical account on the question of self-describeness and self-reproduction, and after discussing the definition of suitable encodings for self-describeness, we give the construction of several self-describing Turing machines, namely ...
Comments