74 search results - page 1 / 15 » Enumerating randoms |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We define a class of “algebraic” random matrix channels for which one can generically compute the limiting Shannon transform using numerical techniques and often enumerate th...
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.
CORR
2010
Springer
12 years 11 months ago
2010
Springer
We investigate enumerability properties for classes of random reals which permit recursive approximations from below, or left-r.e. reals. In addition to pinpointing the complexity...
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...