On the universal computing power of amorphous computing systems

DOI10.1007/s00224-009-9178-6zbMath1187.68333OpenAlexW2037707012MaRDI QIDQ733749

Lukáš Petrů, Juraj Wiedermann

Publication date: 19 October 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://www.nusl.cz/ntk/nusl-37658

zbMATH Keywords

simulationuniversalityprobabilistic automataamorphous computingcommunication protocol

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (3)

A Robust Universal Flying Amorphous Computer ⋮ Nanomachine Computing by Quorum Sensing ⋮ Amorphous computing: a research agenda for the near future

Cites Work

• Unnamed Item
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Continuum percolation of wireless ad hoc communication networks
• Algorithmic Aspects of Wireless Sensor Networks
• A Model of an Amorphous Computer and Its Communication Protocol
• Graph Drawing
• SOFSEM 2006: Theory and Practice of Computer Science

This page was built for publication: On the universal computing power of amorphous computing systems