A Universal Flying Amorphous Computer

Authors: Lukáš Petrů, Jiří Wiedermann
Publication year: 2011
Publication type: Konferenční příspěvek (mezinárodní konf.)
Periodical: Unconventional Computation
Projects: NoSCoM: Non-Standard Computational Models and Their Applications in Complexity, Linguistics, and Learning
Bibliographic citation: PETRŮ, Lukáš, WIEDERMANN, Jiří. A Universal Flying Amorphous Computer. In: CALUDE, C.S., KARI, J., PETRE, I., ROZENBERG, G., eds. Unconventional Computation. Berlin: Springer, 2011, S. 189-200. Lecture Notes in Computer Science, 6714. ISBN 978-3-642-21340-3. ISSN 0302-9743
Dostupné z: doi:10.1007/978-3-642-21341-0_22
DOI: 10.1007/978-3-642-21341-0_22
ID: 364445

Abstract

Amorphous computers are systems that derive their computational capability from the operation of vast numbers of simple, identical, randomly distributed and locally communicating units. The wireless communication ability and the memory capacity of the computational units is severely restricted due to their minimal size. Moreover, the units originally have no identifiers and can only use simple communication protocols that cannot guarantee a reliable message delivery. In this work we concentrate on a so-called flying amorphous computer whose units are in a constant motion. The units are modelled by miniature RAMs communicating via radio. We design a distributed probabilistic communication protocol and an algorithm enabling a simulation of a RAM infinite time. The underlying algorithms make use of a number of original ideas having no counterpart in the classical theory of distributed computing. Our result is the first one showing computational universality of a flying amorphous computer.