Algorithmic Irreducibility in a Cellular Automata Universe
Gregory Chaitin (IBM T. J. Watson Research Center, USA)
Abstract: We discuss how to compute the halting probability Omega in the limit in a cellular automata world.
Keywords: cellular automaton, halting probability Omega
Categories: F.1
|