Texto completo
Vista Previa |
PDF (Portable Document Format)
- Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (832kB) | Vista Previa |
Networks of polarized evolutionary processors are computationally complete
Cita
Arroyo Montoro, Fernando 
ORCID: https://orcid.org/0000-0002-2364-7312, Gómez Canaval, Sandra María ORCID: https://orcid.org/0000-0002-9757-7871, Mitrana, Victor ORCID: https://orcid.org/0000-0002-1457-8933 and Popescu, Stefan
(2014).
Networks of polarized evolutionary processors are computationally complete.
En: "8th International Conference, LATA 2014 Madrid, Spain, March 10-14, 2014 : Proceedings", 10-14 de marzo de 2014, Madrid, España. ISBN 978-3-319-04920-5. pp. 101-112.
https://doi.org/10.1007/978-3-319-04921-2_8.
ORCID: https://orcid.org/0000-0002-2364-7312, Gómez Canaval, Sandra María ORCID: https://orcid.org/0000-0002-9757-7871, Mitrana, Victor ORCID: https://orcid.org/0000-0002-1457-8933 and Popescu, Stefan
(2014).
Networks of polarized evolutionary processors are computationally complete.
En: "8th International Conference, LATA 2014 Madrid, Spain, March 10-14, 2014 : Proceedings", 10-14 de marzo de 2014, Madrid, España. ISBN 978-3-319-04920-5. pp. 101-112.
https://doi.org/10.1007/978-3-319-04921-2_8.
Descripción
| Título: | Networks of polarized evolutionary processors are computationally complete |
|---|---|
| Autor/es: |
|
| Tipo de Documento: | Ponencia en Congreso o Jornada (Artículo) |
| Título del Evento: | 8th International Conference, LATA 2014 Madrid, Spain, March 10-14, 2014 : Proceedings |
| Fechas del Evento: | 10-14 de marzo de 2014 |
| Lugar del Evento: | Madrid, España |
| Título del Libro: | Language and automata theory and applications : 8th International Conference, LATA 2014 Madrid, Spain, March 10-14, 2014 : Proceedings |
| Fecha: | 2014 |
| ISBN: | 978-3-319-04920-5 |
| Volumen: | 8370 |
| Materias: | |
| ODS: | |
| Escuela: | E.T.S.I. de Sistemas Informáticos (UPM) |
| Departamento: | Sistemas Informáticos |
| Licencias Creative Commons: | Reconocimiento - Sin obra derivada - No comercial |
Resumen
ABSTRACT
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.
Más información
| ID de Registro: | 41613 |
|---|---|
| Identificador DC: | https://oa.upm.es/41613/ |
| Identificador OAI: | oai:oa.upm.es:41613 |
| Identificador DOI: | 10.1007/978-3-319-04921-2_8 |
| URL Oficial: | https://link.springer.com/chapter/10.1007/978-3-31... |
| Depositado por: | Memoria Investigacion |
| Depositado el: | 09 Jun 2017 18:00 |
| Ultima Modificación: | 05 Nov 2024 07:15 |
Acciones
- Estadísticas
- Exportar cita
- Editar (sólo personal del Archivo)
