Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
Paper
Algorithmic irreducibility in a cellular automata universe
Abstract
We discuss how to compute the halting probability Omega in the limit in a cellular automata world. © J.UCS.
Related
Conference paper
Strong and flexible domain typing for dynamic E-business
Yigal Hoffner, Simon Field, et al.
EDOC 2004
G. Ramalingam
Theoretical Computer Science
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design