Decision problems for tag systems

&
Journal of Symbolic Logic 36 (2):229-239 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270257

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 105,859

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Burton Dreben and Stål Aanderaa. Herbrand analyzing functions. Bulletin of the American Mathematical Society, vol. 70 , pp. 697–698. [REVIEW]Peter Andrews - 1968 - Journal of Symbolic Logic 32 (4):521.
Burton Dreben, Peter Andrews, and Stål Aanderaa. False lemmas in Herbrand. Bulletin of the American Mathematical Society, vol. 69 , pp. 699–706. [REVIEW]Paul Bernays - 1966 - Journal of Symbolic Logic 31 (4):657-659.
Tag Systems and Lag Systems.Hao Wang, John Cocke, Marvin Minsky & Stephen A. Cook - 1971 - Journal of Symbolic Logic 36 (2):344-344.
Aanderaa-Kugel.[author unknown] - 1990 - Journal of Symbolic Logic 55 (4):1391-1431.
Aanderaa-Levy.[author unknown] - 1990 - Journal of Symbolic Logic 55 (4):1330-1362.
Aanderaa-Cherry.[author unknown] - 1990 - Journal of Symbolic Logic 55 (4):1479-1520.
Many-one degrees associated with problems of tag.C. E. Hughes - 1973 - Journal of Symbolic Logic 38 (1):1-17.
Size and Structure of Universal Turing Machines using Tag Systems.M. L. Minsky - 1966 - Journal of Symbolic Logic 31 (4):655-655.
Patrick C. Fischer. On formalisms for Turing machines. Journal of the Association for Computing Machinery, vol. 12 , pp. 570–580. - Stål Aanderaa and Patrick C. Fischer. The solvability of the halting problem for 2-state Post machines. Journal of the Association for Computing Machinery, vol. 14 , pp. 677–682. - Patrick C. Fischer. Quantificational variants on the halting problem for Turing machines. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 15 , pp. 211–218. [REVIEW]Gabor T. Herman - 1971 - Journal of Symbolic Logic 36 (3):532-534.
Review: M. L. Minsky, Size and Structure of Universal Turing Machines using Tag Systems. [REVIEW]Martin Davis - 1966 - Journal of Symbolic Logic 31 (4):655-655.

Analytics

Added to PP
2009-01-28

Downloads
68 (#337,521)

6 months
3 (#1,172,308)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Machine Configuration and Word Problems of Given Degree of Unsolvability.J. C. Shepherdson - 1965 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (2):149-175.
On deterministic normal systems.Paul Axt & W. E. Singletary - 1969 - Mathematical Logic Quarterly 15 (4‐5):49-62.
On deterministic normal systems.Paul Axt & W. E. Singletary - 1969 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 15 (4-5):49-62.

View all 6 references / Add more references