Computing A Glimpse of Randomness

Details Computing A Glimpse of Randomness Computing A Glimpse of Randomness

2001-12-17

arxiv.org/abs/nlin/0112022v3

Nonlinear Sciences

Chaotic Dynamics

16 pages; Experimental Mathematics (accepted)

Scientific paper

A Chaitin Omega number is the halting probability of a universal Chaitin (self-delimiting Turing) machine. Every Omega number is both computably enumerable (the limit of a computable, increasing, converging sequence of rationals) and random (its binary expansion is an algorithmic random sequence). In particular, every Omega number is strongly non-computable. The aim of this paper is to describe a procedure, which combines Java programming and mathematical proofs, for computing the exact values of the first 64 bits of a Chaitin Omega: 0000001000000100000110001000011010001111110010111011101000010000. Full description of programs and proofs will be given elsewhere.

Affiliated with

Also associated with

No associations

Rating

Computing A Glimpse of Randomness does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing A Glimpse of Randomness, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing A Glimpse of Randomness will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-261730