|
| |
|
|
Universality in Amorphous Computing
Petrů, Lukáš ; Wiedermann, Jiří (vedoucí práce) ; Janeček, Jan (oponent) ; Neruda, Roman (oponent)
Amorphous computer is a theoretical computing model consisting of randomly located tiny devices (called nodes) in some target area. The nodes of an amorphous computer can communicate using short-range radio. The communication radius is small compared to the size of the target area. The nodes are all identical, initially have no identi ers, work asynchronously and there is no standard communication protocol. An amorphous computer must work for any number of nodes under reasonable statistical assumptions concerning the spatial distribution of nodes. Moreover, the computation should use very limited amount of memory on each node. For the just described concept of amorphous computer we investigate the question whether a universal computation is possible at all in a corresponding theoretical model. To answer this question, several subsequent steps are performed. In the rst step, we design a formal minimalist model of a node and of the amorphous computer as a whole. In the second step, we develop communication protocol for the amorphous computer. In the last step, we show the universality by simulating a computation of a universal machine. The size of the amorphous computer will depend on the space complexity of the simulated machine. All the previously mentioned steps are described in detail in this work....
|
|
|
Universality in Amorphous Computing
Petrů, Lukáš ; Wiedermann, Jiří (vedoucí práce) ; Janeček, Jan (oponent) ; Neruda, Roman (oponent)
Amorphous computer is a theoretical computing model consisting of randomly located tiny devices (called nodes) in some target area. The nodes of an amorphous computer can communicate using short-range radio. The communication radius is small compared to the size of the target area. The nodes are all identical, initially have no identi ers, work asynchronously and there is no standard communication protocol. An amorphous computer must work for any number of nodes under reasonable statistical assumptions concerning the spatial distribution of nodes. Moreover, the computation should use very limited amount of memory on each node. For the just described concept of amorphous computer we investigate the question whether a universal computation is possible at all in a corresponding theoretical model. To answer this question, several subsequent steps are performed. In the rst step, we design a formal minimalist model of a node and of the amorphous computer as a whole. In the second step, we develop communication protocol for the amorphous computer. In the last step, we show the universality by simulating a computation of a universal machine. The size of the amorphous computer will depend on the space complexity of the simulated machine. All the previously mentioned steps are described in detail in this work....
|
|
|
Znalostní meze (super)inteligentních systémů
Wiedermann, Jiří
V příspěvku ukážeme nový pohled na inteligenci založený na znalostním přístupu k výpočtům. Výpočty budeme chápat jako procesy, které generují znalosti nad danou znalostní doménou v rámci příslušné znalostní teorie. V tomto kontextu budeme uvažovat inteligenci jako schopnost získávat informace a transformovat je na znalosti, které jsou dále využívány pro řešení problémů. Hlavním výsledkem příspěvku je poznatek, že pokud je znalostní doména konečná a neměnná, pak lze konstruovat inteligentní systémy s tzv. samo-zlepšující se znalostní teorii, které dříve nebo později dosáhnou takový stav poznání o dané doméně, který již nelze dále kvalitativně vylepšovat. Systém tak dosáhne meze své inteligence.
|
|
| |
|
| |
|
| |
|
|
Inconspicuous Appeal of Amorphous Computing Systems
Wiedermann, Jiří
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.
|
|
| |
|
| |
host ::
RSS.