Computing A Glimpse of Randomness
Cristian S. Calude, Michael J. Dinneen, Chi-Kou Shu
Abstract
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.
Create a lesson
Related papers
A Second-Order Asymptotic Expansion for Nonlinear Filtering in the Lorenz--63 System
Masahiro Kurisaki, Kota Takeda
Heterogeneity-induced chaos in globally coupled Stuart--Landau oscillators
Luekai Zhao, Nariya Uchida
Adiabatic confinement and escape in an open billiard
Matheus Rolim Sales, Leonardo Costa de Souza, Ricardo Luiz Viana et al.
A Renormalization-Group Hierarchy of Stochastic Effective Dynamics Learned through Path Integrals
Yuki Yasuda, Tobias Bischoff
ETM-3D: A One-Parameter Multistable Quadratic Flow with an Explicit Absorbing Set and Intermittent Chaos
Roya Khalili-Amirabadi, Mohsen Jalaeian-Farimani
Influence of astrocyte feedback and noise on breathing neural clusters
Ediline L. F. Nguessap, Thierry Njougouo, Fernando F. Ferreira