Computer Studies of Turing Machine Problems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Computer Studies of Turing Machine Problems

Full text

Pdf (1.03 MB)

Source

Journal of the ACM (JACM) archive
Volume 12 , Issue 2 (April 1965) table of contents

Pages: 196 - 212

Year of Publication: 1965

ISSN:0004-5411

Authors

Shen Lin	Bell Telephone Laboratories, Inc., Murray Hill, New Jersey
Tibor Rado	The Ohio Stage University and Battelle Memorial Institute, Columbus, Ohio

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 12, Downloads (12 Months): 97, Citation Count: 7

Additional Information:

references cited by index terms collaborative colleagues

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/321264.321270 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	KLEENE, S.C. Introduction to Metamathematics. D. Van Nostrand, Princeton, 1952.
	2	RADO, T. On non-computable functions. Bell Sys. Tech. J. 41, 3 (May, 1962).
	3	--. On Non-Computable Functions. The Bell Telephone System Monograph 4199, 1962.

CITED BY 7

	Gregory J. Chaitin, Information-Theoretic Limitations of Formal Systems, Journal of the ACM (JACM), v.21 n.3, p.403-424, July 1974
	Chris Salzberg, From Machine and Tape to Structure and Function: Formulation of a Reflexively Computing System, Artificial Life, v.12 n.4, p.487-512, October 2006
	Pascal Michel, Small turing machines and generalized busy beaver competition, Theoretical Computer Science, v.326 n.1-3, p.45-56, 20 October 2004
	T. R. S. Walsh, The busy beaver on a one-way infinite tape, ACM SIGACT News, v.14 n.1, p.38-43, Winter 1982
	James Harland, The busy beaver, the placid platypus and other crazy creatures, Proceedings of the 12th Computing: The Australasian Theroy Symposium, p.79-86, January 16-19, 2006, Hobart, Australia
	James Harland, Analysis of busy beaver machines via induction proofs, Proceedings of the thirteenth Australasian symposium on Theory of computing, p.71-78, January 30-February 02, 2007, Ballarat, Victoria, Australia
	Bryant A. Julstrom, A bound on the shift function in terms of the Busy Beaver function, ACM SIGACT News, v.23 n.3, p.100-106, Summer 1992