1806 search results - page 3 / 362 » Randomness and halting probabilities |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
— The problem of random number generation dates
CIE
2007
Springer
14 years 1 months ago
2007
Springer
This paper introduces two complexity-theoretic formulations of Bennett’s computational depth: finite-state depth and polynomial-time depth. It is shown that for both formulation...
ISCI
2010
13 years 5 months ago
2010
A random set can be regarded as the result of the imprecise observation of a random variable. Following this interpretation, we study to which extent the upper and lower probabili...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually def...
AMC
2010
13 years 7 months ago
2010
: We present a formula to calculate the probability density function of the solution of the random linear transport equation in terms of the density functions of the velocity and t...