Complexity-preserving simulations among three variants of accepting networks of evolutionary processors

Authors:
Paolo Bottoni;Anna Labella;Florin Manea;Victor Mitrana;Ion Petre;Jose M. Sempere
Affiliations:
Department of Computer Science, "Sapienza" University of Rome, Rome, Italy 00198;Department of Computer Science, "Sapienza" University of Rome, Rome, Italy 00198;Faculty of Computer Science, Otto-von-Guericke University, Magdeburg, Germany 39016;Faculty of Mathematics, University of Bucharest, Bucharest, Romania 010014 and Depto. Organización y Estructura de la Información, Universidad Politécnica de Madrid, Madrid, Spain 2 ...;Department of Information Technologies, Åbo Akademi University, Turku, Finland 20520;Department of Information Systems and Computation, Technical University of Valencia, Valencia, Spain 46022
Venue:
Natural Computing: an international journal
Year:
2011

Citing 12
Cited 0

The connection machine

The connection machine
Towards a new architecture for symbolic processing

AIICSR'94 Proceedings of the sixth international conference on Artificial intelligence and information-control systems of robots
Computing with membranes

Journal of Computer and System Sciences
Handbook of Formal Languages

Handbook of Formal Languages
Networks of Parallel Language Processors

New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Solving NP-Complete Problems With Networks of Evolutionary Processors

IWANN '01 Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Connectionist Models of Neurons, Learning Processes and Artificial Intelligence-Part I
On the size complexity of universal accepting hybrid networks of evolutionary processors

Mathematical Structures in Computer Science
On the size of computationally complete hybrid networks of evolutionary processors

Theoretical Computer Science
Networks of Evolutionary Picture Processors with Filtered Connections

UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof

DNA Computing and Molecular Programming
On the power of networks of evolutionary processors

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Accepting hybrid networks of evolutionary processors

DNA'04 Proceedings of the 10th international conference on DNA computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider three variants of accepting networks of evolutionary processors. It is known that two of them are equivalent to Turing machines. We propose here a direct simulation of one device by the other. Each computational step in one model is simulated in a constant number of computational steps in the other one while a translation via Turing machines squares the time complexity. We also discuss the possibility of constructing simulations that preserve not only complexity, but also the shape of the simulated network.