On Efficiency and Predictability of the Dynamics of Discrete-Time Boolean Networks

[1]  Predrag T. Tosic.  Phase Transitions in Possible Dynamics of Cellular and Graph Automata Models of Sparsely Interconnected Multi-Agent Systems , 2017, AAMAS.

[2]  Predrag T. Tosic.  Cellular Automata Communication Models: Comparative Analysis of Parallel, Sequential and Asynchronous CA with Simple Threshold Update Rules , 2010, Int. J. Nat. Comput. Res..

[3]  Pekka Orponen,et al.  General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results , 2003, Neural Computation.

[4]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[5]  Dirk Helbing,et al.  Social Self-Organization , 2012 .

[6]  Pekka Orponen,et al.  On the Computational Complexity of Analyzing Hopfield Nets , 1989, Complex Syst..

[7]  Stephen Wolfram.  Cellular Automata And Complexity: Collected Papers , 2019 .

[8]  Stefania Bandini,et al.  Heterogeneous Agents Situated in Heterogeneous Spaces , 2002, Appl. Artif. Intell..

[9]  Christian M. Reidys,et al.  Discrete, sequential dynamical systems , 2001, Discret. Math..

[10]  Predrag T. Tosic.  On the complexity of enumerating possible dynamics of sparsely connected Boolean network automata with simple update rules , 2010, Automata.

[11]  Carlos Ordonez,et al.  Boolean Network Models of Collective Dynamics of Open and Closed Large-Scale Multi-agent Systems , 2017, HoloMAS.

[12]  Predrag T. Tosic.  On Modeling and Analyzing Sparsely Networked Large-Scale Multi-agent Systems with Cellular and Graph Automata , 2006, International Conference on Computational Science.

[13]  Predrag T. Tosic.  On the Complexity of Counting Fixed Points and Gardens of Eden in Sequential Dynamical Systems on Planar Bipartite Graphs , 2006, Int. J. Found. Comput. Sci..

[14]  Predrag T. Tosic.  Cellular automata for distributed computing: models of agent interaction and their implications , 2005, 2005 IEEE International Conference on Systems, Man and Cybernetics.

[15]  Gul A. Agha,et al.  Characterizing Configuration Spaces of Simple Threshold Cellular Automata , 2004, ACRI.

[16]  Neil Davey,et al.  High capacity, small world associative memory models , 2006, Connect. Sci..

[17]  Roberto Serra,et al.  Dynamical Properties of a Boolean Model of Gene Regulatory Network with Memory , 2011, J. Comput. Biol..

[18]  Predrag T. Tosic.  On Simple Models of Associative Memory: Network Density Is Not Required for Provably Complex Behavior , 2016, BIH.

[19]  Harry B. Hunt,et al.  Reachability problems for sequential dynamical systems with threshold functions , 2003, Theor. Comput. Sci..

[20]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[21]  Harry B. Hunt,et al.  Gardens of Eden and Fixed Points in Sequential Dynamical Systems , 2001, DM-CCG.

[22]  Gul A. Agha,et al.  On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata , 2005, UC.

[23]  Pekka Orponen,et al.  Computational complexity of neural networks: a survey , 1994 .

[24]  S. Kauffman.  Emergent properties in random complex automata , 1984 .