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
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
Hierarchies of memory limited computations
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Hybrid networks of evolutionary processors
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
On the size complexity of hybrid networks of evolutionary processors
Theoretical Computer Science - Descriptional complexity of formal systems
Accepting networks of splicing processors: Complexity results
Theoretical Computer Science
Information Processing Letters
On the size complexity of universal accepting hybrid networks of evolutionary processors
Mathematical Structures in Computer Science
International Journal of Computer Mathematics
On Accepting Networks of Splicing Processors of Size 3
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
On small, reduced, and fast universal accepting networks of splicing processors
Theoretical Computer Science
On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Multi-agent Simulation of Linguistic Processes: A NEPs Perspective
Agent Computing and Multi-Agent Systems
On the size of computationally complete hybrid networks of evolutionary processors
Theoretical Computer Science
Computing Natural Language with Biomolecules: Overview and Challenges
IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part I: Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira's Scientific Legacy
Networks of Evolutionary Picture Processors with Filtered Connections
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
The role of evolutionary operations in accepting hybrid networks of evolutionary processors
Information and Computation
Natural Computing: an international journal
Deciding networks of evolutionary processors
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Analysing sentences with networks of evolutionary processors
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Timed accepting hybrid networks of evolutionary processors
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Solving 3CNF-SAT and HPP in linear time using WWW
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Biocomputing: an insight from linguistics
Natural Computing: an international journal
Accepting Networks of Genetic Processors are computationally complete
Theoretical Computer Science
Complexity results for deciding Networks of Evolutionary Processors
Theoretical Computer Science
P systems with minimal left and right insertion and deletion
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Networks of polarized evolutionary processors
Information Sciences: an International Journal
| Hi-index | 0.00 |
We consider time complexity classes defined on accepting hybrid networks of evolutionary processors (AHNEP) similarly to the classical time complexity classes defined on the standard computing model of Turing machine. By definition, AHNEPs are deterministic. We prove that the classical complexity class NP equals the set of languages accepted by AHNEPs in polynomial time.