A Variant to Turing's Theory of Computing Machines

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A Variant to Turing's Theory of Computing Machines

Full text

Pdf (1.93 MB)

Source

Journal of the ACM (JACM) archive
Volume 4 , Issue 1 (January 1957) table of contents

Pages: 63 - 92

Year of Publication: 1957

ISSN:0004-5411

Author

Hao Wang

University of Oxford, Oxford, England

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 74, Citation Count: 20

Additional Information:

references cited by index terms

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/320856.320867 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	A. M. TURING, On computable numbers, Proc. London Math. Soc., Series 2, 24 (1936), 230--265.
	2	S. C. KLEENE:, Introduction to Metamathematics, 1952.
	3	A. W. BURKS and I. M. CoPI, The logical design of an idealized general-purpose computer, J. Franklin Inst., 261 (1956), 299-314, 421-436.
	4	E. F. Moore, A simplified universal Turing machine, Proceedings of the 1952 ACM national meeting (Toronto), p.50-54, June 1952, Toronto, Ontario, Canada [doi>10.1145/800259.808993]

CITED BY 20

	Calvin C. Elgot , Abraham Robinson, Random-Access Stored-Program Machines, an Approach to Programming Languages, Journal of the ACM (JACM), v.11 n.4, p.365-399, Oct. 1964
	C. Y. Lee, Categorizing Automata by W-Machine Programs, Journal of the ACM (JACM), v.8 n.3, p.384-399, July 1961
	David Pager, Further Results on the Problem of Finding Minimal Length Programs for Decision Tables, Journal of the ACM (JACM), v.21 n.2, p.207-212, April 1974
	J. C. Shepherdson , H. E. Sturgis, Computability of Recursive Functions, Journal of the ACM (JACM), v.10 n.2, p.217-255, April 1963
	John Case, A Note on Degrees of Self-Describing Turing Machines, Journal of the ACM (JACM), v.18 n.3, p.329-338, July 1971
	R. J. Nelson, Invited papers—1: basic concepts of automata theory, Proceedings of the 1965 20th national conference, p.138-161, August 24-26, 1965, Cleveland, Ohio, United States
	Bruce W. Arden, On introducing digital computing, Communications of the ACM, v.7 n.4, p.212-214, April 1964
	William F. Atchison , Samuel D. Conte , John W. Hamblen , Thomas E. Hull , Thomas A. Keenan , William B. Kehl , Edward J. McCluskey , Silvio O. Navarro , Werner C. Rheinboldt , Earl J. Schweppe , William Viavant , David M. Young, Jr., Curriculum 68: Recommendations for academic programs in computer science: a report of the ACM curriculum committee on computer science, Communications of the ACM, v.11 n.3, p.151-197, March 1968
	John Cocke , Marvin Minsky, Universality of Tag Systems with P = 2, Journal of the ACM (JACM), v.11 n.1, p.15-20, Jan. 1964
	M. W. Curtis, A Turing Machine Simulator, Journal of the ACM (JACM), v.12 n.1, p.1-13, Jan. 1965
	B. M. Leavenworth, Programming with(out) the GOTO, Proceedings of the ACM annual conference, p.782-786, August 01-01, 1972, Boston, Massachusetts, United States
	Patrick C. Fischer, Multi-tape and infinite-state automata—a survey, Communications of the ACM, v.8 n.12, p.799-805, Dec. 1965
	E. K. Blum, Towards a theory of semantics and compilers for programming languages, Proceedings of the first annual ACM symposium on Theory of computing, p.217-227, May 05-07, 1969, Marina del Rey, California, United States
	Arthur W. Burks , Hao Wang, The Logic of Automata—Part I, Journal of the ACM (JACM), v.4 n.2, p.193-218, April 1957
	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
	B. M. Leavenworth, Programming with(out) the GOTO, ACM SIGPLAN Notices, v.7 n.11, November 1972
	Maurice Margenstern , Yurii Rogozhin, Self-describing Turing machines, Fundamenta Informaticae, v.50 n.3, p.285-303, May 2002
	Walter R. Stahl , Robert W. Coffin , Harry E. Goheen, Simulation of biological cells by systems composed of string-processing finite automata, Proceedings of the April 21-23, 1964, spring joint computer conference, April 21-23, 1964, Washington, D.C.
	Patrick C. Fischer, Theory of computing in computer science education, Proceedings of the November 16-18, 1971, fall joint computer conference, November 16-18, 1971, Las Vegas, Nevada
	Damien Woods , Turlough Neary, The complexity of small universal Turing machines: A survey, Theoretical Computer Science, v.410 n.4-5, p.443-450, February, 2009