|
Descripción
|
|
|---|---|
| In this paper, we consider the computational power of a new variant of networks of evolutionary processors which seems to be more suitable for a software and hardware implementation. Each processor as well as the data navigating throughout the network are now considered to be polarized. While the polarization of every processor is predefined, the data polarization is dynamically computed by means of a valuation mapping. Consequently, the protocol of communication is naturally defined by means of this polarization. We show that tag systems can be simulated by these networks with a constant number of nodes, while Turing machines can be simulated, in a time-efficient way, by these networks with a number of nodes depending linearly on the tape alphabet of the Turing machine. | |
|
Internacional
|
Si |
|
DOI
|
10.1007/978-3-319-04921-2_8 |
|
Edición del Libro
|
|
|
Editorial del Libro
|
Springer International Publishing |
|
ISBN
|
978-3-319-04920-5 |
|
Serie
|
Lecture Notes in Computer Science |
|
Título del Libro
|
Language and Automata Theory and Applications |
|
Desde página
|
101 |
|
Hasta página
|
112 |