ACM Home Page
Please provide us with feedback. Feedback
A Turing Machine Simulator
Full text PdfPdf (608 KB)
Source Journal of the ACM (JACM) archive
Volume 12 ,  Issue 1  (January 1965) table of contents
Pages: 1 - 13  
Year of Publication: 1965
ISSN:0004-5411
Author
M. W. Curtis  Wesleyan University, Middletown, Connecticut
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 47,   Citation Count: 3
Additional Information:

references   cited by   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321250.321251
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
2
 
3
---, Automata and finite automata, BSTI 99, 5 (1960), 1267-1695.
 
4
MINSKY, M. L. Reeursive ursolvabitity of Post's problem of "Tag" and other topics in theory of TURNINGg machine. J. Malh. 775, 3 (Nov. 1961).
 
5
KLEENE, s. Introductin, to Megamathematics, Van Nostrand, New York, 1952.
 
6
Turnig A. M. On computable numbers with an application to the Entseheidungsproblem. Proc. Lond. Math See 2, 43 (1936), 230-265.
 
7
SHGANON, C. A universal Turing machine with two internal slates. In Aulomata Studies, Princeton U. Press, 1956.
 
8
RABIN, M. O., aND SCOTT, D. Finite automata and their decision problems. IBM J Res. Develop. 3 (1959), 114-125.
9