A Note on Degrees of Self-Describing Turing Machines

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A Note on Degrees of Self-Describing Turing Machines

Full text

Pdf (685 KB)

Source

Journal of the ACM (JACM) archive
Volume 18 , Issue 3 (July 1971) table of contents

Pages: 329 - 338

Year of Publication: 1971

ISSN:0004-5411

Author

John Case

University of Kansas, Department of Computer Science, Lawrence, Kansas

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 36, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321650.321651 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	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.
	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.
	3	ROGERS, H., JR. Computing degrees of unsolvability. Math. Ann. 138 (1959), 125-140.
	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.
	5	Hartley Rogers, Jr., Theory of recursive functions and effective computability, MIT Press, Cambridge, MA, 1987
	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.
	7	MINSKY, M. Matter, mind, and models. In Proc. IFIP Cong. I965, Vol. 1, North Holland Pub. Co., Amsterdam, pp. 45-49.
	8	Hao Wang, A Variant to Turing's Theory of Computing Machines, Journal of the ACM (JACM), v.4 n.1, p.63-92, Jan. 1957 [doi>10.1145/320856.320867]
	9	MYHILL, J. Creative sets, Zeitschr Math. Logik Grundl. Math. 1 (1955), 97-108.
	10	KLEENE, S.C. Introduction to Metamathematics. Van Nostrand, Princeton, N. J., 1952.
	11	G6DEL, K. Uber formal unentscheidbare si~tze derPrincipiaMathematica undverwandter systeme I. Monatsh. Math. Phys. 38 (1931), 173-198.

CITED BY 2

	Maurice Margenstern , Yurii Rogozhin, Self-describing Turing machines, Fundamenta Informaticae, v.50 n.3, p.285-303, May 2002
	Moshe Sipper, Fifty years of research on self-replication: an overview, Artificial Life, v.4 n.3, p.237-257, Summer 1998