The Halting Problem of one State Turing Machines with n‐Dimensional Tape

Mathematical Logic Quarterly 14 (7-12):185-191 (1968)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19680140706

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,247

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

Quantificational variants on the halting problem for turing machines.Patrick C. Fischer - 1969 - Mathematical Logic Quarterly 15 (13-15):211-218.
Busy beaver competition and Collatz-like problems.Pascal Michel - 1993 - Archive for Mathematical Logic 32 (5):351-367.
The Halting Problem Is Decidable on a Set of Asymptotic Probability One.Joel David Hamkins & Alexei Miasnikov - 2006 - Notre Dame Journal of Formal Logic 47 (4):515-524.
The unsolvability of the uniform halting problem for two state Turing machines.Gabor T. Herman - 1969 - Journal of Symbolic Logic 34 (2):161-165.
Infinite Time Turing Machines With Only One Tape.D. E. Seabold & J. D. Hamkins - 2001 - Mathematical Logic Quarterly 47 (2):271-287.
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.
Turing's World 3.0 for Mac: An Introduction to Computability Theory.Jon Barwise & John Etchemendy - 1993 - Center for the Study of Language and Information Publications.
Infinite time extensions of Kleene’s $${\mathcal{O}}$$.Ansten Mørch Klev - 2009 - Archive for Mathematical Logic 48 (7):691-703.
Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups.Daniel E. Cohen, Klaus Madlener & Friedrich Otto - 1993 - Mathematical Logic Quarterly 39 (1):143-157.
Definability by turing machines.R. M. Baer - 1969 - Mathematical Logic Quarterly 15 (20-22):325-332.

Analytics

Added to PP
2013-11-24

Downloads
60 (#355,631)

6 months
8 (#583,676)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Representation and Reality by Language: How to make a home quantum computer?Vasil Penchev - 2020 - Philosophy of Science eJournal (Elsevier: SSRN) 13 (34):1-14.
A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory.Vasil Penchev - 2020 - Information Theory and Research eJournal 1 (15):1-13.

Add more citations

References found in this work

A Universal Turing Machine with Two Internal States.Claude E. Shannon - 1971 - Journal of Symbolic Logic 36 (3):532-532.
A Note on Universal Turing Machines.M. D. Davis & Martin Davis - 1970 - Journal of Symbolic Logic 35 (4):590-590.

Add more references