Words in the History of a Turing Machine with a Fixed Input

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Words in the History of a Turing Machine with a Fixed Input

Full text

Pdf (126 KB)

Source

Journal of the ACM (JACM) archive
Volume 10 , Issue 4 (October 1963) table of contents

Pages: 526 - 527

Year of Publication: 1963

ISSN:0004-5411

Authors

Michael O. Rabin	University of Jerusalem and Harvard University
Hao Wang	University of Jerusalem and Harvard University

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 35, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	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/321186.321195 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	ULLIAN, J. S. J. Symbolic Logic 25, 33-38.
	2	MINSKY, M. Recursive unsolvability of Post's problem of tag. Ann. Math. 74 (1961), 437 455.
	3	WABNG, HAO. Lag systems and tag systems. Math. Ann. (to appear).