A theory for nondeterminism, parallelism, communication, and concurrency
Theoretical Computer Science
ACM SIGSOFT Software Engineering Notes
On E. W. Dijkstra's position paper on “fairness:''
ACM SIGSOFT Software Engineering Notes
Journal of the ACM (JACM)
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Feynman Lectures on Computation
Feynman Lectures on Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Botanical computing: a developmental approach to generating interconnect topologies on an amorphous computer
Introduction to amorphous computing
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
DRAGON: Detection and Tracking of Dynamic Amorphous Events in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
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.