Algorithmic irreducibility in a cellular automata universe

Paper

01 Dec 2005

Abstract

We discuss how to compute the halting probability Omega in the limit in a cellular automata world. © J.UCS.

Conference paper

Maurice Hanan, Peter K. Wolff, et al.

DAC 1976

Workshop paper

Robert G. Farrell, Catalina M. Danis, et al.

RecSys 2012

Paper

Ohad Shamir, Sivan Sabato, et al.

Theoretical Computer Science

Conference paper

Donald Samuels, Ian Stobert

SPIE Photomask Technology + EUV Lithography 2007