Computation: finite and infinite machines
Computation: finite and infinite machines
Theoretical Computer Science
Computability in Amorphous Structures
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
How We Think of Computing Today
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
On the Universal Computing Power of Amorphous Computing Systems
Theory of Computing Systems - Special Issue: Computation and Logic in the Real World; Guest Editors: S. Barry Cooper, Elvira Mayordomo and Andrea Sorbi
On stateless multihead automata: Hierarchies and the emptiness problem
Theoretical Computer Science
An environment aware p-system model of quorum sensing
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
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
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.01 |
A biologically motivated computational model of wirelessly communicating self-reproducing mobile embodied automata -- nanomachines -- is defined. Their wireless communication mechanism is inspired by molecular communication. Thus, the automata are augmented by an input/output mechanism modelling sensation/production of the signal molecules and by a mechanism measuring their concentration. The communication, reproductive, concentration measuring, and time measuring "organs" of the automata represent their embodiment. The embodiment description is not a part of the model -- its existence is merely postulated. The computational part of nanomachines is modelled by finite state automata. Orchestration of their actions is done via quorum sensing. That means that collective decisions are based on measuring the concentration of signal molecules produced and sensed by individual machines. The main result claims that in a closed environment with a high concentration of uniformly distributed signal molecules a system of such nanomachines can simulate any counter automaton with arbitrary small probability of error. By equipping the machines with an additional memory organ, the finite state control can be substituted by circuits of constant depth. In a real world such computational systems could be realized by genetically engineered bacteria or by artificial nanomachines produced by self-assembly.