JUCS - Journal of Universal Computer Science 11(12): 1901-1903, doi: 10.3217/jucs-011-12-1901
Algorithmic Irreducibility in a Cellular Automata Universe
expand article infoGregory Chaitin‡
‡ IBM T. J. Watson Research Center, United States of America

Corresponding author: Gregory Chaitin ( chaitin@us.ibm.com )

© Gregory Chaitin.
This article is freely available under the J.UCS Open Content License.
Citation: Chaitin G (2005) Algorithmic Irreducibility in a Cellular Automata Universe. JUCS - Journal of Universal Computer Science 11(12): 1901-1903. https://doi.org/10.3217/jucs-011-12-1901
Open Access
Abstract
We discuss how to compute the halting probability Omega in the limit in a cellular automata world.
Keywords
halting probability Omega, cellular automaton