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)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

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

Through your library

Similar books and articles

A simple solution of the uniform halting problem.Gabor T. Herman - 1969 - Journal of Symbolic Logic 34 (4):639-640.
Infinite time extensions of Kleene’s $${\mathcal{O}}$$.Ansten Mørch Klev - 2009 - Archive for Mathematical Logic 48 (7):691-703.
Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
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.
Uniform domain representations of "Lp" -spaces.Petter K. Køber - 2007 - Mathematical Logic Quarterly 53 (2):180-205.

Analytics

Added to PP
2013-11-24

Downloads
21 (#630,965)

6 months
1 (#1,040,386)

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

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
A simple solution of the uniform halting problem.Gabor T. Herman - 1969 - Journal of Symbolic Logic 34 (4):639-640.

Add more references