|
Descripción
|
|
|---|---|
| In this paper, we improve some results regarding the size complexity of accepting hybrid networks of evolutionary processors (AHNEPs).We show that there are universal AHNEPs of size 6, by devising a method for simulating 2-tag systems. This result improves the best upper bound for the size of universal AHNEPs which was 7.We also propose a computationally and descriptionally efficient simulation of nondeterministic Turing machines with AHNEPs. More precisely, we prove that AHNEPs with ten nodes can simulate any nondeterministic Turing machine of time complexity f (n) in time O( f (n)). This result significantly improves the best known upper bound for the number of nodes in a network simulating in linear time an arbitrary Turing machine, namely 24. | |
|
Internacional
|
Si |
|
JCR del ISI
|
Si |
|
Título de la revista
|
ACTA INFORMATICA |
|
ISSN
|
0001-5903 |
|
Factor de impacto JCR
|
0,923 |
|
Información de impacto
|
|
|
Volumen
|
47 |
|
DOI
|
|
|
Número de revista
|
2 |
|
Desde la página
|
133 |
|
Hasta la página
|
146 |
|
Mes
|
MARZO |
|
Ranking
|
|