Strong Computability and Variants of the Uniform Halting Problem

Mathematical Logic Quarterly 17 (1):115-131 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19710170117

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

Strong Computability and Variants of the Uniform Halting Problem.Gabor T. Herman - 1971 - Mathematical Logic Quarterly 17 (1):115-131.
A simple solution of the uniform halting problem.Gabor T. Herman - 1969 - Journal of Symbolic Logic 34 (4):639-640.
The unsolvability of the uniform halting problem for two state Turing machines.Gabor T. Herman - 1969 - Journal of Symbolic Logic 34 (2):161-165.
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.
Conditional computability of real functions with respect to a class of operators.Ivan Georgiev & Dimiter Skordev - 2013 - Annals of Pure and Applied Logic 164 (5):550-565.
Infinite time extensions of Kleene’s $${\mathcal{O}}$$.Ansten Mørch Klev - 2009 - Archive for Mathematical Logic 48 (7):691-703.
A mechanical proof of the unsolvability of the halting problem.Robert Boyer - unknown
Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
Metrization of the Uniform Space and Effective Convergence.Y. Tsujii, T. Mori & M. Yasugi - 2002 - Mathematical Logic Quarterly 48 (S1):123-130.
Non-Turing Computers and Non-Turing Computability.Mark Hogarth - 1994 - Psa 1994:126--138.
Singular coverings and non‐uniform notions of closed set computability.Stéphane Le Roux & Martin Ziegler - 2008 - Mathematical Logic Quarterly 54 (5):545-560.
Some Remarks on Uniform Halting Problems.Stephen L. Bloom - 1971 - Mathematical Logic Quarterly 17 (1):281-284.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Some Remarks on Uniform Halting Problems.Stephen L. Bloom - 1971 - Mathematical Logic Quarterly 17 (1):281-284.
A computable version of Banach’s Inverse Mapping Theorem.Vasco Brattka - 2009 - Annals of Pure and Applied Logic 157 (2-3):85-96.

Analytics

Added to PP
2016-02-04

Downloads
33 (#470,805)

6 months
2 (#1,263,261)

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

No references found.

Add more references