A Universal Flying Amorphous Computer
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F11%3A00364445" target="_blank" >RIV/67985807:_____/11:00364445 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-21341-0_22" target="_blank" >http://dx.doi.org/10.1007/978-3-642-21341-0_22</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-21341-0_22" target="_blank" >10.1007/978-3-642-21341-0_22</a>
Alternative languages
Result language
angličtina
Original language name
A Universal Flying Amorphous Computer
Original language description
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 infinitetime. 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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GAP202%2F10%2F1333" target="_blank" >GAP202/10/1333: NoSCoM: Non-Standard Computational Models and Their Applications in Complexity, Linguistics, and Learning</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Unconventional Computation
ISBN
978-3-642-21340-3
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
189-200
Publisher name
Springer
Place of publication
Berlin
Event location
Turku
Event date
Jun 6, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—