Buscar
Mostrando ítems 1-7 de 7
Ponencia
Molecular Computation Models in ACL2: a Simulation of Lipton’s Experiment Solving SAT
(2002)
In this paper we present an ACL2 formalization of a molecular computing model: Adleman’s restricted model [2]. This is a first step to formalize unconventional models of computation in ACL2. As an application of this ...
Ponencia
Complexity Classes in Cellular Computing with Membranes
(2003)
In this paper we introduce the complexity class PMC∗ F of all decision problems solvable in polynomial time by a family of P systems belonging to a prefixed class of recognizer membrane systems, F.
Capítulo de Libro
Computationally Hard Problems Addressed Through P Systems
(Springer, 2006)
In this chapter we present a general framework to provide efficient solutions to decision problems through families of cell-like membrane systems constructed in a semi-uniform way (associating with each instance of the ...
Capítulo de Libro
Implementing in Prolog an Effective Cellular Solution to the Knapsack Problem
(Springer, 2004)
In this paper we present an implementation in Prolog of an effective solution to the Knapsack problem via a family of deterministic P systems with active membranes using 2-division.
Capítulo de Libro
Hybrid Networks of Evolutionary Processors
(Springer, 2003)
A hybrid network of evolutionary processors consists of several processors which are placed in nodes of a virtual graph and can perform one simple operation only on the words existing in that node in accordance with ...
Artículo
A Prolog Simulator for Deterministic P Systems with Active Membranes
(Springer, 2004)
In this paper we propose a new way to represent P systems with active membranes based on Logic Programming techniques. This representation allows us to express the set of rules and the configuration of the P system in ...
Capítulo de Libro
The P Versus NP Problem Through Cellular Computing with Membranes
(Springer, 2004)
We study the P versus NP problem through membrane systems. Language accepting P systems are introduced as a framework allowing us to obtain a characterization of the P = NP relation by the polynomial time unsolvability ...