Nanomachine computing by quorum sensing
Computation, cooperation, and life
A universal flying amorphous computer
UC'11 Proceedings of the 10th international conference on Unconventional computation
Amorphous computing: a research agenda for the near future
Natural Computing: an international journal
Cellular automaton based motion planning algorithms for mobile sensor networks
TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing
Computability and non-computability issues in amorphous computing
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.00 |
Amorphous computing differs from the classical ideas about computations almost in every aspect. The architecture of amorphous computers is random, since they consist of a plethora of identical computational units spread randomly over a given area. Within a limited radius the units can communicate wirelessly with their neighbors via a single-channel radio. We consider a model whose assumptions on the underlying computing and communication abilities are among the weakest possible: all computational units are finite state probabilistic automata working asynchronously, there is no broadcasting collision detection mechanism and no network addresses. We show that under reasonable probabilistic assumptions such amorphous computing systems can possess universal computing power with a high probability. The underlying theory makes use of properties of random graphs and that of probabilistic analysis of algorithms. To the best of our knowledge this is the first result showing the universality of such computing systems.