Small universal accepting hybrid networks of evolutionary processors

Authors:
Remco Loos;Florin Manea;Victor Mitrana
Affiliations:
EMBL, European Bioinformatics Institute, Wellcome Trust Genome Campus, CB10 1SD, Hinxton, Cambridge, UK;University of Bucharest, Faculty of Mathematics and Computer Science, Academiei 14, 010014, Bucharest, Romania and Otto-von-Guericke University of Magdeburg, Faculty of Computer Science, PSF 4120, ...;University of Bucharest, Faculty of Mathematics and Computer Science, Academiei 14, 010014, Bucharest, Romania and Technical University of Valencia, Department of Information Systems and Computati ...
Venue:
Acta Informatica
Year:
2010

Citing 0
Cited 4

Target Based Accepting Networks of Evolutionary Processors

Fundamenta Informaticae - Non-Classical Models of Automata and Applications
About complete obligatory hybrid networks of evolutionary processors without substitution

IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I
Deciding networks of evolutionary processors

DLT'11 Proceedings of the 15th international conference on Developments in language theory
Complexity results for deciding Networks of Evolutionary Processors

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.