AbstractIn this paper, we study aspects of computability concerning random variables under the background of Type 2 Theory of Effectivity (TTE). We show that the resulting definitions are “natural” as they suffice to successfully discuss questions of computability of basic queueing systems, e.g. of the so-called M/G/1-system
This thesis establishes results in several different areas of computability theory. The first chapt...
We introduce a notion of computable randomness for infinite sequences that generalises the classical...
The original publication is available at www.springerlink.comInternational audienceWe pursue the stu...
AbstractIn this paper, we study aspects of computability concerning random variables under the backg...
AbstractWe study aspects of computability concerning random events and variables in a computable pro...
AbstractWhile computability theory on many countable sets is well established and for computability ...
AbstractThis paper uses quick process machines to provide characterisations of computable randomness...
Algorithmic randomness uses computability theory to define notions of randomness for infinite object...
AbstractIn this paper we apply some elementary computability-theoretic notions to algorithmic comple...
Any notion of effective randomness that is defined with respect to arbitrary computable probability ...
In this paper we apply some elementary computability-theoretic notions to algorithmic complexity the...
As a part of our works on effective properties of probability distributions,we deal with the corresp...
This thesis establishes significant new results in the area of algorithmic randomness. These results...
By flipping a coin repeatedly and recording the result, we can create a sequence that intuitively is...
International audienceWe provide a survey of recent results in computable measure and probability th...
This thesis establishes results in several different areas of computability theory. The first chapt...
We introduce a notion of computable randomness for infinite sequences that generalises the classical...
The original publication is available at www.springerlink.comInternational audienceWe pursue the stu...
AbstractIn this paper, we study aspects of computability concerning random variables under the backg...
AbstractWe study aspects of computability concerning random events and variables in a computable pro...
AbstractWhile computability theory on many countable sets is well established and for computability ...
AbstractThis paper uses quick process machines to provide characterisations of computable randomness...
Algorithmic randomness uses computability theory to define notions of randomness for infinite object...
AbstractIn this paper we apply some elementary computability-theoretic notions to algorithmic comple...
Any notion of effective randomness that is defined with respect to arbitrary computable probability ...
In this paper we apply some elementary computability-theoretic notions to algorithmic complexity the...
As a part of our works on effective properties of probability distributions,we deal with the corresp...
This thesis establishes significant new results in the area of algorithmic randomness. These results...
By flipping a coin repeatedly and recording the result, we can create a sequence that intuitively is...
International audienceWe provide a survey of recent results in computable measure and probability th...
This thesis establishes results in several different areas of computability theory. The first chapt...
We introduce a notion of computable randomness for infinite sequences that generalises the classical...
The original publication is available at www.springerlink.comInternational audienceWe pursue the stu...
DOI
Add to ORKG