Timed accepting hybrid networks of evolutionary processors

  • Authors:

  • Florin Manea

  • Affiliations:

  • Faculty of Mathematics and Computer Science, University of Bucharest, Bucharest, Romania

  • Venue:
  • 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
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Accepting Hybrid Networks of Evolutionary Processors are bio-inspired, massively parallel computing models that have been used succesfully in characterizing several usual complexity classes and also in solving efficiently decision problems. However, this model does not seem close to the usual algorithms, used in practice, since, in general, it lacks the property of stopping on every input. We add new features in order to construct a model that has this property, and also, is able to characterize uniformly CoNP, issue that was not solved in the framework of regular AHNEPs. This new model is called Timed AHNEPs (TAHNEP). We continue by adressing the topic of problem solving by means of this new defined model. Finally, we propose a tehnique that can be used in the design of algorithms as efficient as possible for a given problem; this tehnique consists in defining the notion of Problem Solver, a model that extends the previously defined TAHNEP.