We study the differences of Martin-Löf random left-c.e. reals and show that for each pair of such reals α,β there exists a unique number r>0 such that qα−β is a Martin-Löf random left-c.e. real for each positive rational q>r and a Martin-Löf random right-c.e. real for each positive rational q<r. Based on this result we develop a theory of differences of halting probabilities, which answers a number of questions about Martin-Löf random left-c.e. reals, including one of the few remaining open problems from the list of open questions in algorithmic randomness [21]. The halting probability of a prefix-free machine M restricted to a set X is the probability that the machine halts and outputs an element of X . Becher, Figueira, Grigorieff, and Mi...
A real is computable if it is the limit of a computable, increasing, computably converging sequence ...
The present work investigates several questions from a recent survey of Miller and Nies related to C...
I Martin-Löf randomness is the most common formalization of randomness I Certain criticisms have sup...
We show that given any non-computable left-c.e. real α there exists a left-c.e. real β such that α≠β...
AbstractThe present work investigates several questions from a recent survey of Miller and Nies rela...
The halting probability of a Turing machine is the probability that the machine will halt if it star...
A Martin-Löf test UU is universal if it captures all non-Martin-Löf random sequences, and it is opti...
AbstractSchnorr randomness is a notion of algorithmic randomness for real numbers closely related to...
AbstractA real α is computably enumerable if it is the limit of a computable, increasing, converging...
Schnorr showed that a real X is Martin-Löf random if and only if K(X �n) ≥ n − c for some constant c...
Abstract. Every K-trivial set is computable from an incomplete Martin-Löf random set, i.e., a Marti...
AbstractIn this paper we introduce the notion of ε-universal prefix-free Turing machine (ε is a comp...
In this dissertation we investigate two questions in the subject of algorithmic randomness. The firs...
The Kučera–Gács theorem is a landmark result in algorithmic randomness asserting that every real is ...
We investigate the strength of a randomness notion R as a set-existence principle in second-order ar...
A real is computable if it is the limit of a computable, increasing, computably converging sequence ...
The present work investigates several questions from a recent survey of Miller and Nies related to C...
I Martin-Löf randomness is the most common formalization of randomness I Certain criticisms have sup...
We show that given any non-computable left-c.e. real α there exists a left-c.e. real β such that α≠β...
AbstractThe present work investigates several questions from a recent survey of Miller and Nies rela...
The halting probability of a Turing machine is the probability that the machine will halt if it star...
A Martin-Löf test UU is universal if it captures all non-Martin-Löf random sequences, and it is opti...
AbstractSchnorr randomness is a notion of algorithmic randomness for real numbers closely related to...
AbstractA real α is computably enumerable if it is the limit of a computable, increasing, converging...
Schnorr showed that a real X is Martin-Löf random if and only if K(X �n) ≥ n − c for some constant c...
Abstract. Every K-trivial set is computable from an incomplete Martin-Löf random set, i.e., a Marti...
AbstractIn this paper we introduce the notion of ε-universal prefix-free Turing machine (ε is a comp...
In this dissertation we investigate two questions in the subject of algorithmic randomness. The firs...
The Kučera–Gács theorem is a landmark result in algorithmic randomness asserting that every real is ...
We investigate the strength of a randomness notion R as a set-existence principle in second-order ar...
A real is computable if it is the limit of a computable, increasing, computably converging sequence ...
The present work investigates several questions from a recent survey of Miller and Nies related to C...
I Martin-Löf randomness is the most common formalization of randomness I Certain criticisms have sup...