Enumerating randoms

14 years 10 months ago

Download www.math.hawaii.edu

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 of left-r.e. Martin-L

Bjørn Kjos-Hanssen, Frank Stephan, Jason Te

Real-time Traffic

CORR 2010 | Education | Random Reals | Randoms | Reals |

claim paper

» The analytic computability of the Shannon transform for a large class of random matrix cha...

» Enumeration Construction and Random Generation of Block Codes

» Random Generation and Enumeration of Bipartite Permutation Graphs

» Equivalent characterizations of partial randomness for a recursively enumerable real

» Enumerating Contingency Tables via Random Permanents

» Random Generation and Enumeration of Proper Interval Graphs

» Asymptotic Enumeration of Eulerian Circuits in the Complete Graph

» Error Exponents of ErasureList Decoding Revisited via Moments of Distance Enumerators

Post Info
More Details (n/a)

Added	16 May 2011
Updated	16 May 2011
Type	Journal
Year	2010
Where	CORR
Authors	Bjørn Kjos-Hanssen, Frank Stephan, Jason Teutsch

Comments (0)

Sciweavers

Enumerating randoms

CORR 2010 | Education | Random Reals | Randoms | Reals |

Explore & Download

Productivity Tools

Sciweavers