|
| |
|
| |
|
|
Universality in Amorphous Computing
Petrů, Lukáš ; Wiedermann, Jiří (advisor) ; Janeček, Jan (referee) ; Neruda, Roman (referee)
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....
|
|
|
Comparative analysis of communication of politics in Otázky Václava Moravce
Petrů, Lukáš ; Klabíková Rábová, Tereza (advisor) ; Šoltys, Otakar (referee)
The aim of this work is analyzed using qualitative analysis, complemented by case study method of communication selected politicians. Within the specified period, were selected speakers (Milos Zeman and Bohuslav Sobotka) and selected specific dialogues. Due to the absence of publicly available transcripts of interviews was conducted without using literal transcription techniques detailed evaluation. Was described the context of the time, including the characteristics of the speakers. The theoretical part was further characterized the program Questions of Vaclav Moravec including his discourse. There were explaining the difference between discussion and debate in relation to issues of Vaclav Moravec. The methods used were placed in the context of qualitative research and explained their validity. Communication methods are described by way of comparison argumentative testimony and linguistic resources between the two speakers. They describe the kinds of good, but also erroneous arguments. A communication strategy was explained in terms of humor, opinions and attitudes, using parasitic words, expressive and abusive terms, slips of the tongue, foreign and technical terms, syntax errors.
|
|
|
Universality in Amorphous Computing
Petrů, Lukáš ; Wiedermann, Jiří (advisor) ; Janeček, Jan (referee) ; Neruda, Roman (referee)
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....
|
|
| |
|
| |
|
| |
guest ::
RSS feed.