International audience ; Fix an optimal Turing machine U and for each n consider the ratio ρ^U_n of the number of halting programs of length at most n by the total number of such programs. Does this quantity have a limit value? In this paper, we show that it is not the case, and further characterise the reals which can be the limsup of such a sequence ρUn. We also study, for a given optimal machine U, how hard it is to approximate the domain of U from the point of view of coarse and generic computability
When we understand that every potential halt decider must derive a formal mathematical proof from it...
AbstractIt has been shown in [J.D. Hamkins, A. Miasnikov, The halting problem is decidable on a set ...
AbstractA new criterion, namely, the number of colours used by the instructions of a Turing machine ...
International audienceFix an optimal Turing machine U and for each n consider the ratio ρ^U_n of the...
We position Turing's result regarding the undecidability of the halting problem as a result about pr...
AbstractIn this paper we establish a lower bound for the simultaneous complexity of the halting prob...
Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction...
AbstractThe aim of this paper is to provide a probabilistic, but non-quantum, analysis of the Haltin...
We focus on the halting probability and the number of instructions executed by programs that halt fo...
Limit computable functions can be characterized by Turing jumps on the inputside or limits on the ou...
In [1], Turing has established the well-known result of the indecidability of the general halting pr...
Let h be any rapidly increasing function recursive in the halting problem. One can find a double rec...
Turing assemblers are Turing machines which operate on n-dimensional tapes under restrictions which ...
The P versus NP problem is to determine whether every language accepted by some nondeterministic alg...
... Marcus identify eight stages in the development of the concept of a mathematical proof in suppor...
When we understand that every potential halt decider must derive a formal mathematical proof from it...
AbstractIt has been shown in [J.D. Hamkins, A. Miasnikov, The halting problem is decidable on a set ...
AbstractA new criterion, namely, the number of colours used by the instructions of a Turing machine ...
International audienceFix an optimal Turing machine U and for each n consider the ratio ρ^U_n of the...
We position Turing's result regarding the undecidability of the halting problem as a result about pr...
AbstractIn this paper we establish a lower bound for the simultaneous complexity of the halting prob...
Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction...
AbstractThe aim of this paper is to provide a probabilistic, but non-quantum, analysis of the Haltin...
We focus on the halting probability and the number of instructions executed by programs that halt fo...
Limit computable functions can be characterized by Turing jumps on the inputside or limits on the ou...
In [1], Turing has established the well-known result of the indecidability of the general halting pr...
Let h be any rapidly increasing function recursive in the halting problem. One can find a double rec...
Turing assemblers are Turing machines which operate on n-dimensional tapes under restrictions which ...
The P versus NP problem is to determine whether every language accepted by some nondeterministic alg...
... Marcus identify eight stages in the development of the concept of a mathematical proof in suppor...
When we understand that every potential halt decider must derive a formal mathematical proof from it...
AbstractIt has been shown in [J.D. Hamkins, A. Miasnikov, The halting problem is decidable on a set ...
AbstractA new criterion, namely, the number of colours used by the instructions of a Turing machine ...