Amorphous computing: examples, mathematics and theory

The cellular automata model was described by John von Neumann and his friends in the 1950s as a representation of information processing in multicellular tissue. With crystalline arrays of cells and synchronous activity, it missed the mark (Stark and Hughes, BioSystems 55:107–117, 2000). Recently, amorphous computing, a valid model for morphogenesis in multicellular information processing, has begun to fill the void. Through simple examples and elementary mathematics, this paper begins a computation theory for this important new direction.

[1]  Daniel Coore,et al.  Botanical computing: a developmental approach to generating interconnect topologies on an amorphous computer , 1999 .

[2]  Qi Han,et al.  DRAGON: Detection and Tracking of Dynamic Amorphous Events in Wireless Sensor Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

[3]  Manfred Broy,et al.  A Theory for Nondeterminism, Parallelism, Communication, and Concurrency , 1986, Theor. Comput. Sci..

[4]  Robert W. Floyd,et al.  Nondeterministic Algorithms , 1967, JACM.

[5]  Dana Angluin,et al.  Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.

[6]  Gérard Le Lann,et al.  Distributed Systems - Towards a Formal Approach , 1977, IFIP Congress.

[7]  W. R. Stark,et al.  Asynchronous, irregular automata nets: the path not taken. , 2000, Bio Systems.

[8]  Kenneth C. W. Kammeyer,et al.  An introduction to population , 1974 .

[9]  Arthur W. Burks,et al.  Essays on cellular automata , 1970 .

[10]  P. W. Hutson.  Another “Position” Paper , 1962 .

[11]  J. Neumann.  The General and Logical Theory of Au-tomata , 1963 .

[12]  Edsger W. Dijkstra.  Position paper on “fairness" , 1988, SOEN.

[13]  E. Schrödinger,et al.  What is life? : the physical aspect of the living cell , 1946 .

[14]  Steven H. Strogatz,et al.  Sync: How Order Emerges from Chaos in the Universe, Nature, and Daily Life , 2004 .

[15]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[16]  Nigel Ward,et al.  Applications of Angelic Nondeterminism , 1991 .

[17]  Daniel Coore,et al.  Introduction to Amorphous Computing , 2004, UPP.

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Robert W. Floyd,et al.  Assigning Meanings to Programs , 1993 .

[20]  F. B. Schneider,et al.  On E. W. Dijkstra's position paper on “fairness:'' , 1988, SOEN.

[21]  James Aspnes,et al.  An Introduction to Population Protocols , 2007, Bull. EATCS.

[22]  A. Edwards,et al.  Sync-how order emerges from chaos in the universe, nature, and daily life , 2005 .

[23]  J. Weeks.  An introduction to population , 2012 .

[24]  Klaus Sutner,et al.  Linear cellular automata and the garden-of-eden , 1989 .

[25]  Algirdas Avizienis,et al.  Position Paper , 1994, EDCC.

[26]  Andrzej Pelc,et al.  Leader election for anonymous asynchronous agents in arbitrary networks , 2012, Distributed Computing.

[27]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[28]  Charles H. Bennett,et al.  Notes on Landauer's Principle, Reversible Computation, and Maxwell's Demon , 2002, physics/0210005.

[29]  A. M. Turing,et al.  The chemical basis of morphogenesis , 1952, Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences.