Applying causality principles to the axiomatization of probabilistic cellular automata

Details Applying causality principles to the axiomatization of probabilistic cellular automata Applying causality principles to the axiomatization of probabilistic cellular automata

2011-02-04

arxiv.org/abs/1102.0860v2

Computer Science

Discrete Mathematics

13 pages, 6 figures, LaTeX, v2: refs added

Scientific paper

Cellular automata (CA) consist of an array of identical cells, each of which may take one of a finite number of possible states. The entire array evolves in discrete time steps by iterating a global evolution G. Further, this global evolution G is required to be shift-invariant (it acts the same everywhere) and causal (information cannot be transmitted faster than some fixed number of cells per time step). At least in the classical, reversible and quantum cases, these two top-down axiomatic conditions are sufficient to entail more bottom-up, operational descriptions of G. We investigate whether the same is true in the probabilistic case. Keywords: Characterization, noise, Markov process, stochastic Einstein locality, screening-off, common cause principle, non-signalling, Multi-party non-local box.

Affiliated with

Also associated with

No associations

Rating

Applying causality principles to the axiomatization of probabilistic cellular automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Applying causality principles to the axiomatization of probabilistic cellular automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Applying causality principles to the axiomatization of probabilistic cellular automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-491617