74 search results - page 2 / 15 » Every Computably Enumerable Random Real Is Provably Computab... |
TCS
2002
13 years 4 months ago
2002
A real is computably enumerable if it is the limit of a computable, increasing, converging sequence of rationals. A real is random if its binary expansion is a random sequence. Ou...
DCC
1998
IEEE
13 years 4 months ago
1998
IEEE
We discuss some methods for the enumeration, construction and random generation of isometry classes of block codes using methods from algebraic combinatorics.
STACS
2001
Springer
13 years 9 months ago
2001
Springer
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...
CIE
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-L¨of random left-compu...
COLT
2003
Springer
13 years 10 months ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...