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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

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

The Halting Problem of one State Turing Machines with n‐Dimensional Tape.G. T. Herman - 1968 - Mathematical Logic Quarterly 14 (7‐12):185-191.
Busy beaver competition and Collatz-like problems.Pascal Michel - 1993 - Archive for Mathematical Logic 32 (5):351-367.
Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
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.
A brief critique of pure hypercomputation.Paolo Cotogno - 2009 - Minds and Machines 19 (3):391-405.
Even Turing machines can compute uncomputable functions.Jack Copeland - unknown
Undecidability over Continuous Time.Jerzy Mycka & José Félix Costa - 2006 - Logic Journal of the IGPL 14 (5):649-658.
Solution to a generalization of the busy Beaver problem.David Miller - 2003
Kolmogorov complexity for possibly infinite computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.
Infinite Time Turing Machines With Only One Tape.D. E. Seabold & J. D. Hamkins - 2001 - Mathematical Logic Quarterly 47 (2):271-287.
A mechanical proof of the unsolvability of the halting problem.Robert Boyer - unknown
Computable Diagonalizations and Turing’s Cardinality Paradox.Dale Jacquette - 2014 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 45 (2):239-262.
The diagonal method and hypercomputation.Toby Ord & Tien D. Kieu - 2005 - British Journal for the Philosophy of Science 56 (1):147-156.
Infinite time extensions of Kleene’s $${\mathcal{O}}$$.Ansten Mørch Klev - 2009 - Archive for Mathematical Logic 48 (7):691-703.

Analytics

Added to PP
2016-02-04

Downloads
28 (#555,203)

6 months
2 (#1,232,442)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

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

Add more references