Theory, Knowledge and Science Commons^™

Reconstructability Analysis Of Elementary Cellular Automata, Martin Zwick, Hui Shi

Systems Science Friday Noon Seminar Series

Reconstructability analysis is a method to determine whether a multivariate relation, defined set- or information-theoretically, is decomposable with or without loss (reduction in constraint) into lower ordinality relations. Set-theoretic reconstructability analysis (SRA) is used to characterize the mappings of elementary cellular automata. The degree of lossless decomposition possible for each mapping is more effective than the λ parameter (Walker & Ashby, Langton) as a predictor of chaotic dynamics.

Complete SRA yields not only the simplest lossless structure but also a vector of losses of all decomposed structures, indexed by parameter, τ. This vector subsumes λ, Wuensche’s Z parameter, and Walker …