Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

TCS
2002

favoriteEmaildiscussreport

97views Theoretical Computer Science» more TCS 2002»

A characterization of c.e. random reals

13 years 4 months ago

A characterization of c.e. random reals

Download www.cs.auckland.ac.nz

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. Our aim is to o er a self-contained proof, based on the papers (Calude et al., in: M. Morvan, C. Meinel, D. Krob (Eds.), Proc. 15th Symp. on Theoretical Aspects of Computer Science, Paris, Springer, Berlin, 1998, pp. 596

Cristian Calude

Real-time Traffic

IBM Thomas J | Random | Random Sequence | TCS 2002 | Theoretical Computer Science |

claim paper

Related Content

» Equivalent characterizations of partial randomness for a recursively enumerable real

» Randomness and the linear degrees of computability

» A sellers perspective characterization methodology for online auctions

» Characterization and Parameterized Random Generation of Digital Circuits

» Sampling directed graphs with random walks

» The Denjoy alternative for computable functions

» Higher Kurtz randomness

» Markovian Framework for ForegroundBackgroundShadow Separation of Real World Video Scenes

» Topology Selection in Graphical Models of Autoregressive Processes

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	TCS
Authors	Cristian Calude

Comments (0)