scispace - formally typeset
BookDOI

Membrane Computing 15th International Conference, CMC 2014

Reads0
Chats0
TLDR
Amorphous computing systems typically consist of myriads of tiny simple processors that are randomly distributed at fixed positions or move randomly in a confined volume and are among the simplest (non-uniform) universal computational devices.
Abstract
Amorphous computing systems typically consist of myriads of tiny simple processors that are randomly distributed at fixed positions or move randomly in a confined volume. The processors are “embodied” meaning that each of them has its own source of energy, has a “body” equipped with various sensors and communication means and has a computational control part. Initially, the processors have no identifiers and from the technological reasons, in the interest of their maximal simplicity, their computational, communication, sensory and locomotion (if any) parts are reduced to an absolute minimum. The processors communicate wirelessly, e.g., in an airborne medium they communicate via a short-range radio, acoustically or optically and in a waterborne medium via molecular communication. In the extreme cases the computational part of the processors can be simplified down to probabilistic finite state automata or even combinatorial circuits and the system as a whole can still be made universally programmable. From the theoretical point of view the structure and the properties of the amorphous systems qualify them among the simplest (non-uniform) universal computational devices. From the practical viewpoint, once technology will enable a mass production of the required processors a host of new applications so far inaccessible to classical approaches to computing will follow. Extended Abstract: The history of amorphous computing systems began by the end of the twentieth century, mainly as an engineering endeavor (cf. [1], [2], [4], [5], [6], or [13]). Namely, in those days the progress in constructing the micro-electro-mechanical systems (MEMS) has enabled to think of devices integrating a central data processing unit (the microprocessor) and several components that interact with the surroundings such as micro-sensors, wireless communication unit, and the energy source in a small unit. These parts can possibly be complemented by micro-actuators and locomotive means. The resulting device can be viewed as an embodied computational unit. Note that such a unit possesses all the necessary parts characterizing autonomous embodied robots. MEMS devices generally range in size from 20 micrometres (20 × 10−6 m) to a millimetre (i.e. 0.02 to 1.0 mm). Current ideas about nano-electro-mechanical systems (NEMS) and nano-technology consider such systems at a nano-scale (10−9 m). The driving force behind the respective development has mainly been a vision of huge amounts of the respective “micro-robots” engaged in various application tasks This work was partially supported by RVO 67985807 and the GA ČR grant No. P202/10/1333.

read more

Citations
More filters
Journal ArticleDOI

Computation in Living Cells: Gene Assembly in Ciliates

TL;DR: Only for you today!
Journal Article

What Was, What Is, and What Will Be!

TL;DR: The estimates of the order O(α s) QCD corrections to R(s) = σtot(e e → hadrons)/ σ(ee → μμ), Rτ = Γ(τ → ντ +hadrons)/Γ(Γ →ντνee) are presented.
Journal ArticleDOI

A Cluster Splitting Technique by Hopfield Networks and P Systems on Simplices

TL;DR: This paper proposes a new graph based P system that has membrane compartments spread on edges as well as on vertices and uses the new graph P systems to obtain stable status of the neural networks.
Journal ArticleDOI

Variants of P systems with activation and blocking of rules

TL;DR: New possibilities to control the application of rules based on the preceding applications are introduced, which can be defined in a general way for (hierarchical) P systems and the main known derivation modes.
References
More filters
Book

Introduction to Automata Theory, Languages, and Computation

TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Journal ArticleDOI

On Computable Numbers, with an Application to the Entscheidungsproblem

TL;DR: This chapter discusses the application of the diagonal process of the universal computing machine, which automates the calculation of circle and circle-free numbers.
Book

Theory of Self-Reproducing Automata

TL;DR: This invention relates to prefabricated buildings and comprises a central unit having a peripheral section therearound to form a main residential part defined by an assembly of juxtaposed roofing and facing trusses.
Journal ArticleDOI

Molecular computation of solutions to combinatorial problems

TL;DR: This experiment demonstrates the feasibility of carrying out computations at the molecular level by solving an instance of the directed Hamiltonian path problem with standard protocols and enzymes.