Abstract
The framework for the information dynamics of distributed computation introduced in Chaps. 3–5 has proven successful in locally identifying the component operations of information storage, transfer and modification. We have observed that while these component operations exist to some extent in all types of computation, complex computation is distinguished in having coherent structure in its local information dynamics profiles. We conjecture that coherent information structure is a defining feature of complex computation, particularly evolved computation that solves human-understandable tasks. We present a methodology for studying coherent information structure, consisting of state-space diagrams of the local information dynamics and a measure of structure in these diagrams. The methodology identifies both clear and “hidden” coherent structure in complex computation, most notably reconciling conflicting interpretations of the complexity of ECA rule 22. The measure is also used to demonstrate a maximisation of coherent information structure in the order-chaos phase-transition in RBNs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The methodology for studying coherent information structure and the results of its application to CAs were first reported in [1].
- 2.
Also, in Sect. 8.3 we will observe the emergence of coherent particle-like information structures in a snake-like robot evolved to maximise transfer entropy between its segments.
- 3.
See also [10] for a discussion of the term “coherent structure” referring to particles (including blinkers) in this context.
- 4.
Indeed, the candidate measures considered in Appendix G did not capture its alignment with the known complex rules in this respect.
- 5.
For example, \(t^c(i,j=-1,n,k)\) is almost completely specified by \(a(i,n,k)\) and \(t(i,j=1,n,k)\) in ECAs, except for any difference in \(h(i,n)\) between the “0” and “1” states.
- 6.
Note we have altered our notation for mutual and multi-information expressions from \(I_{X;Y}\) to \(I(X;Y)\) here. This is simply for easier display of the complicated quantities over which the information is being calculated.
- 7.
This is similar to the manner in which the local information dynamics measures themselves reveal more about the underlying computation than their averages do.
References
J.T. Lizier, M. Prokopenko, A.Y. Zomaya, Coherent information structure in complex computation, Theory Biosci. 131(3), 193–203 (2012), doi:10.1007/s12064-011-0145-9
P. Fernández, R.V. Solé, The role of computation in complex regulatory networks, in Scale-free Networks and Genome Biology, ed. by E.V. Koonin, Y.I. Wolf, G.P. Karev (Landes Bioscience, Georgetown, 2006), pp. 206–225
P. Fernández, R.V. Solé, Neutral fitness landscapes in signalling networks. J. R. Soc. Interface, 4(12) 41–47 (2007)
A. Cavagna, A. Cimarelli, I. Giardina, G. Parisi, R. Santagati, F. Stefanini, M. Viale, Scale-free correlations in starling flocks, in Proceedings of the National Academy of Sciences, vol. 107, no. 26, pp. 11, 865–11,870 (2010)
I. Couzin, R. James, D. Croft, J. Krause, Social Organization and Information Transfer in Schooling Fishes, in Fish Cognition and Behavior, ser. Fish and Aquatic Resources, ed. by B.C.K. Laland, J. Krause (Blackwell Publishing, Oxford, 2006), pp. 166–185
D. Peak, J.D. West, S.M. Messinger, K.A. Mott, Evidence for complex, collective dynamics and emergent, distributed computation in plants. Proc. Nat. Acad. Sci. U.S.A. 101(4), 918–922 (2004)
P. Gong, C. van Leeuwen, Distributed dynamical computation in neural circuits with propagating coherent activity patterns. PLoS Comput. Biol. 5(12), e1000611 (2009)
M. Mitchell, J.P. Crutchfield, P.T. Hraber, Evolving cellular automata to perform computations: Mechanisms and impediments. Phys. D. 75, 361–391 (1994)
M. Mitchell, J. P. Crutchfield, and R. Das, Evolving cellular automata with genetic algorithms: A review of recent work, in Proceedings of the First International Conference on Evolutionary Computation and Its Applications ed. by E.D. Goodman, W. Punch, V. Uskov. (Russian Academy of Sciences, Moscow, 1996)
C.R. Shalizi, R. Haslinger, J.-B. Rouquier, K.L. Klinkner, C. Moore, Automatic filters for the detection of coherent structure in spatiotemporal systems. Phys. Rev. E 73(3), 036104 (2006)
T. Helvik, K. Lindgren, and M. G. Nordahl, Local information in one-dimensional cellular automata, in Proceedings of the International Conference on Cellular Automata for Research and Industry, ed. by P.M. Sloot, B. Chopard, A.G. Hoekstra. Amsterdam, ser. Lecture Notes in Computer Science. vol. 3305. (Springer, Berlin, 2004), pp. 121–130
J.E. Hanson, J.P. Crutchfield, The attractor-basin portait of a cellular automaton. J. Stat. Phys. 66, 1415–1462 (1992)
Oxford english dictionary(2008) [Online]. Available url: http://www.oed.com/ Accessed 8 May 2008
C.G. Langton, Computation at the edge of chaos: phase transitions and emergent computation. Physica D 42(1–3), 12–37 (1990)
M. Prokopenko, Guided self-organization. HFSP J. 3(5), 287–289 (2009)
P. Jung, J. Wang, R. Wackerbauer, K. Showalter, Coherent structure analysis of spatiotemporal chaos. Phys. Rev. E. 61(2), 2095–2098 (2000)
J.P. Crutchfield, K. Young, Inferring statistical complexity. Phys. Rev. Lett. 63(2), 105 (1989)
D.P. Feldman, C.S. McTague, J.P. Crutchfield, The organization of intrinsic computation: Complexity-entropy diagrams and the diversity of natural information processing. Chaos 18(4), 043106 (2008)
D.P. Feldman, J.P. Crutchfield, Structural information in two-dimensional patterns: Entropy convergence and excess entropy. Phys. Rev. E. 67(5), 051104 (2003)
H. Kantz, T. Schreiber, Nonlinear Time Series Analysis (Cambridge University Press, Cambridge, 1997)
R. V. Solé and S. Valverde, Information theory of complex networks: On evolution and architectural constraints, in Complex Networks, ser. eds. E. Ben-Naim, H. Frauenfelder, Z. Toroczkai. Lecture Notes in Physics, vol. 650, (Springer, Berlin, 2004) pp. 189–207
M. Prokopenko, F. Boschietti, A.J. Ryan, An information-theoretic primer on complexity, self-organization, and emergence. Complex. 15(1), 11–28 (2009)
A.S. Ribeiro, S.A. Kauffman, J. Lloyd-Price, B. Samuelsson, J.E.S. Socolar, Mutual information in random Boolean models of regulatorynetworks. Phys. Rev. E 77(1), 011901 (2008)
C. Gershenson, Phase transitions in random Boolean networks with different updating schemes (2004), arXiv:nlin/0311008v1. url:http://arxiv.org/abs/nlin/0311008
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lizier, J.T. (2013). Coherent Information Structure in Complex Computation. In: The Local Information Dynamics of Distributed Computation in Complex Systems. Springer Theses. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32952-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-32952-4_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32951-7
Online ISBN: 978-3-642-32952-4
eBook Packages: EngineeringEngineering (R0)