Information modification and particle collisions in distributed computation.

@article{Lizier2010InformationMA,
  title={Information modification and particle collisions in distributed computation.},
  author={Joseph T. Lizier and Mikhail Prokopenko and Albert Y. Zomaya},
  journal={Chaos},
  year={2010},
  volume={20 3},
  pages={
          037109
        }
}
Distributed computation can be described in terms of the fundamental operations of information storage, transfer, and modification. To describe the dynamics of information in computation, we need to quantify these operations on a local scale in space and time. In this paper we extend previous work regarding the local quantification of information storage and transfer, to explore how information modification can be quantified at each spatiotemporal point in a system. We introduce the separable… 

Figures and Tables from this paper

Towards a synergy-based approach to measuring information modification
TLDR
This work outlines how a recently-introduced axiomatic framework for measuring information redundancy and synergy, called partial information decomposition, can be applied to a perspective of distributed computation in order to quantify component operations on information.
Local measures of information storage in complex distributed computation
Partial information decomposition as a spatiotemporal filter.
TLDR
This work utilizes the new technique of partial information decomposition to show that previous information-theoretic measures can confound distinct sources of information, and proposes a new set of filters that more cleanly separate out the background domains, particles, and collisions that are typically associated with information storage, transfer, and modification in cellular automata.
Coherent information structure in complex computation
TLDR
It is conjecture that coherent information structure is a defining feature of complex computation, particularly in biological systems or artificially evolved computation that solves human-understandable tasks.
Measuring the Dynamics of Information Processing on a Local Scale in Time and Space
TLDR
This chapter reviews the mathematics of how to measure local entropy and mutual information values at specific observations of time-series processes, and describes how these measures can reveal much more intricate details about the dynamics of complex systems than their more well-known “average” measures do.
Symbolic local information transfer
TLDR
This paper proposes measures called symbolic local transfer entropies, and applies them to two test models, the coupled map lattice system and the Bak-Sneppen model, to show their relevance to spatiotemporal systems that have continuous states, and demonstrates that these measures can provide novel insight to the model.
Measuring information storage and transfer in swarms
TLDR
Two localized informationtheoretic measures adapted to the task of tracing the information dynamics in a kinematic context can be applied to non-trivial models and can tell us about the dynamics within these model where the authors can not rely on visual intuitions.
Information storage and transfer in the synchronization process in locally-connected networks
TLDR
Information-theoretical techniques are used to view the synchronization process as a distributed computation, and to measure the information storage and transfer at each node in the system at each time step, producing novel insights, including that the computation of the synchronized state appears to be completed much more quickly than application-specific measures would indicate.
Moving Frames of Reference, Relativity and Invariance in Transfer Entropy and Information Dynamics
TLDR
A new interpretation of a local framework for informationynamics, including the transfer entropy, is presented by defining a moving frame of reference for the observer of dynamics in lattice systems, inspired by the idea of investigating “relativistic” effects on observing the dynamics of information.
Quantifying and Tracing Information Cascades in Swarms
TLDR
This work proposes a novel, information-theoretic, characterisation of cascades within the spatiotemporal dynamics of swarms, explicitly measuring the extent of collective communications and observed that maximal information transfer tends to follow the stage with maximal collective memory.
...
...

References

SHOWING 1-10 OF 35 REFERENCES
The local information dynamics of distributed computation in complex systems
TLDR
A complete information-theoretic framework to quantify these operations on information, and in particular their dynamics in space and time, is applied to cellular automata, and delivers important insights into the fundamental nature of distributed computation and the dynamics of complex systems.
Coherent information structure in complex computation
TLDR
It is conjecture that coherent information structure is a defining feature of complex computation, particularly in biological systems or artificially evolved computation that solves human-understandable tasks.
Local information transfer as a spatiotemporal filter for complex systems.
TLDR
A measure of local information transfer, derived from an existing averaged information-theoretical measure, namely, transfer entropy, is presented, providing the first quantitative evidence for the long-held conjecture that the emergent traveling coherent structures known as particles are the dominant information transfer agents in cellular automata.
Collision-Based Computing
TLDR
The basics of collision-based computing are introduced, the collision- based computing schemes in 1D and 2D cellular automata and continuous excitable media are overviewed, and the overview of collisions where particles/collisions are dimensionless is provided.
Automatic filters for the detection of coherent structure in spatiotemporal systems.
TLDR
Two approaches to automatically filter the changing configurations of spatial dynamical systems and extract coherent structures are presented, a modification of the local Lyapunov exponent approach suitable to cellular automata and other discrete spatial systems and a more traditional approach based on an order parameter and free energy is compared.
Differentiating information transfer and causal effect
TLDR
It is shown that causal information flow is a primary tool to describe the causal structure of a system, while information transfer can then be used to describes the emergent computation on that causal structure.
Particlelike structures and their interactions in spatiotemporal patterns generated by one-dimensional deterministic cellular-automaton rules.
  • Boccara, Nasser, Roger
  • Physics
    Physical review. A, Atomic, molecular, and optical physics
  • 1991
TLDR
A detailed description of such ``reactions'' sheds new light on the large-time behavior of range-1 Rule 54 with a very slow decrease of the particle number, as ${\mathit{t}}^{\mathrm{\ensuremath{-}}\ensure Math{\gamma}}$ (£0.15).
A Group Interpretation Of Particles Generated By One-Dimensional Cellular Automaton, Wolfram'S Rule 54
TLDR
A group which allows the formal study of interactions between particles in one-dimensional cellular automata and using the new algebraic classification of Rapaport proves that rule 54 is not simple.
...
...