On Schnorr and computable randomness, martingales, and machines
- Rod Downey
- Evan Griffiths
- Geoffrey Laforte
DOIAbstract
examine the randomness and triviality of reals using notions arising from martingales and prefix-free machines
examine the randomness and triviality of reals using notions arising from martingales and prefix-free machines
In this dissertation we investigate two questions in the subject of algorithmic randomness. The firs...
Some recent researches show that some classical theorems with \almost ev-erywhere " can be conv...
We give some characterizations of Schnorr triviality. In concrete terms, we introduce a reducibility...
AbstractSchnorr randomness is a notion of algorithmic randomness for real numbers closely related to...
The notion of Schnorr randomness refers to computable reals or computablefunctions. We propose a ver...
Schnorr randomness is a notion of algorithmic randomness for real numbers closely related to Martin-...
AbstractA real is Martin-Löf (Schnorr) random if it does not belong to any effectively presented nul...
Schnorr randomness is a randomness notion based on Brouwer's concept of a "constructive null set." ...
AbstractThis paper uses quick process machines to provide characterisations of computable randomness...
By flipping a coin repeatedly and recording the result, we can create a sequence that intuitively is...
AbstractKurtz randomness is a notion of algorithmic randomness for real numbers. In particular a rea...
Abstract. In the theory of algorithmic randomness, one of the central notions is that of computable ...
We present some new characterizations of Schnorr triviality. The well-known notion of K-triviality i...
This paper defines a new notion of bounded computable randomness for certainclasses of sub-computabl...
We define a random sequence of reals as a random point on a computable topological space. This rando...
In this dissertation we investigate two questions in the subject of algorithmic randomness. The firs...
Some recent researches show that some classical theorems with \almost ev-erywhere " can be conv...
We give some characterizations of Schnorr triviality. In concrete terms, we introduce a reducibility...
AbstractSchnorr randomness is a notion of algorithmic randomness for real numbers closely related to...
The notion of Schnorr randomness refers to computable reals or computablefunctions. We propose a ver...
Schnorr randomness is a notion of algorithmic randomness for real numbers closely related to Martin-...
AbstractA real is Martin-Löf (Schnorr) random if it does not belong to any effectively presented nul...
Schnorr randomness is a randomness notion based on Brouwer's concept of a "constructive null set." ...
AbstractThis paper uses quick process machines to provide characterisations of computable randomness...
By flipping a coin repeatedly and recording the result, we can create a sequence that intuitively is...
AbstractKurtz randomness is a notion of algorithmic randomness for real numbers. In particular a rea...
Abstract. In the theory of algorithmic randomness, one of the central notions is that of computable ...
We present some new characterizations of Schnorr triviality. The well-known notion of K-triviality i...
This paper defines a new notion of bounded computable randomness for certainclasses of sub-computabl...
We define a random sequence of reals as a random point on a computable topological space. This rando...
In this dissertation we investigate two questions in the subject of algorithmic randomness. The firs...
Some recent researches show that some classical theorems with \almost ev-erywhere " can be conv...
We give some characterizations of Schnorr triviality. In concrete terms, we introduce a reducibility...
Add to ORKG