Computing A Glimpse of Randomness
| dc.creator | Calude, Cristian S. | |
| dc.creator | Dinneen, Michael J. | |
| dc.creator | Shu, Chi-Kou | |
| dc.date | 2001-12-17 | |
| dc.date | 2002-02-11 | |
| dc.date.accessioned | 2026-07-07T05:33:48Z | |
| dc.date.available | 2026-07-07T05:33:48Z | |
| dc.description | 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. | |
| dc.description | 16 pages; Experimental Mathematics (accepted) | |
| dc.identifier | https://arxiv.org/abs/nlin/0112022 | |
| dc.identifier | http://arxiv.org/abs/nlin/0112022 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/80132 | |
| dc.subject | Chaotic Dynamics | |
| dc.subject | Adaptation and Self-Organizing Systems | |
| dc.title | Computing A Glimpse of Randomness | |
| dc.type | text |