FUIN
2002
13 years 4 months ago
2002
We consider the notion of algorithmic randomness relative to an oracle. We prove that the probability
TOPLAS
2008
13 years 4 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
AMC
2006
13 years 4 months ago
2006
We first show that the Halting Function (the noncomputable function that solves the Halting Problem) has explicit expressions in the language of calculus. Out of that fact we elab...
TYPES
2000
Springer
13 years 8 months ago
2000
Springer
We present a formalization of the halting problem in Agda, a language based on Martin-L
ALT
1999
Springer
13 years 8 months ago
1999
Springer
Abstract. Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem is reliably EX-learnable. These investigations are carried on by sh...
CIE
2009
Springer
13 years 11 months ago
2009
Springer
This paper studies the Turing degrees of various properties defined for universal numberings, that is, for numberings which list all partial-recursive functions. In particular pro...