Some Recursively Unsolvable Problems in ALGOL-Like Languages

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Some Recursively Unsolvable Problems in ALGOL-Like Languages

Full text

Pdf (1.10 MB)

Source

Journal of the ACM (JACM) archive
Volume 10 , Issue 1 (January 1963) table of contents

Pages: 29 - 47

Year of Publication: 1963

ISSN:0004-5411

Authors

Seymour Ginsburg	System Development Corporation, Santa Monica, California
Gene F. Rose	System Development Corporation, Santa Monica, California

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 21, Citation Count: 5

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/321150.321153 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	BAR-HILS,Er, PERISs, AND SAMMIR. On formal properties of simple phrase srueture grammars phonelik, Saproachwissenchaftz and Kommdbtioforschung 14 (1961) 143- 17.
	2	CHOMSKY, N. On certain formal properties of grammars. Inf Contr. 2 (1959), 137-167.
	3	DAVis, M. Compttability and Uneolvabilily. MeGraw.tIill, New York (1958),
	4	GINsVBURG, S., And HiBAND, T, N. The solvability of machine mappings of regular segs o regular sets. SDC Document 8P-772, Apr. 6 196
	5	Seymour Ginsburg , H. Gordon Rice, Two Families of Languages Related to ALGOL, Journal of the ACM (JACM), v.9 n.3, p.350-371, July 1962 [doi>10.1145/321127.321132]
	6	GINBURGi;, S., AD ROS, G.F. Operations which preserve definability in languages. To appear.
	7	PosT E. A variant of a reeursively unsolvable problem, BULL. Amer. Magh. Soc. (1946)
	8	RABIN, M., and ScoTT, D. Finite automata and their decision problems. IBM J. Res. Dev. , (1959), 114-125.

CITED BY 5

	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
	Saul Gorn, Mechanical languages: a course specification, Communications of the ACM, v.7 n.4, p.219-222, April 1964
	Seymour Ginsburg , Edwin H. Spanier, Quotients of Context-Free Languages, Journal of the ACM (JACM), v.10 n.4, p.487-492, Oct. 1963
	Bruce W. Arden, The role of programming in a Ph.D. computer science program, Communications of the ACM, v.12 n.1, p.31-37, Jan. 1969
	Seymour Ginsburg , Thomas N. Hibbard, Solvability of Machine Mappings of Regular Sets to Regular Sets, Journal of the ACM (JACM), v.11 n.3, p.302-312, July 1964