Small universal spiking neural P systems
A Păun, G Păun - BioSystems, 2007 - Elsevier
In search for small universal computing devices of various types, we consider here the case
of spiking neural P systems (SN P systems), in two variants: as devices that compute …
of spiking neural P systems (SN P systems), in two variants: as devices that compute …
Computational power of tissue P systems for generating control languages
Tissue P systems are a class of distributed and parallel models of computation inspired by
the way of communication among living cells or between cells and their environment. In this …
the way of communication among living cells or between cells and their environment. In this …
Smaller universal spiking neural P systems
The problem of finding small universal spiking neural P systems was recently investigated
by Andrei Păun and Gheorghe Păun, for spiking neural P systems used as devices …
by Andrei Păun and Gheorghe Păun, for spiking neural P systems used as devices …
The complexity of small universal Turing machines: A survey
We survey some work concerned with small universal Turing machines, cellular automata,
tag systems, and other simple models of computation. For example, it has been an open …
tag systems, and other simple models of computation. For example, it has been an open …
Small universal simple spiking neural P systems with weights
Spiking neural P systems with weights (WSN P systems, for short) are a new variant of
spiking neural P systems, where the rules of a neuron are enabled when the potential of that …
spiking neural P systems, where the rules of a neuron are enabled when the potential of that …
[图书][B] Computing with cells: Advances in membrane computing
P Frisco - 2009 - books.google.com
Membrane systems are a new class of distributed and parallel model of computation
inspired by the subdivision of living cells into compartments delimited by membranes. Their …
inspired by the subdivision of living cells into compartments delimited by membranes. Their …
On small universal antiport P systems
E Csuhaj-Varjú, M Margenstern, G Vaszil… - Theoretical Computer …, 2007 - Elsevier
It is known that P systems with antiport rules simulate register machines, ie, they are
computationally complete. Hence, due to the existence of universal register machines, there …
computationally complete. Hence, due to the existence of universal register machines, there …
The complexity of small universal Turing machines: a survey
We survey some work concerned with small universal Turing machines, cellular automata,
tag systems, and other simple models of computation. For example it has been an open …
tag systems, and other simple models of computation. For example it has been an open …
Small universal spiking neural P systems with exhaustive use of rules
We consider the problem of looking for small universal spiking neural P systems with
exhaustive use of rules, which was formulated as an open problem by Andrei Păun and …
exhaustive use of rules, which was formulated as an open problem by Andrei Păun and …
[PDF][PDF] Small universal Turing machines
T Neary - 2008 - Citeseer
Numerous results for simple computationally universal systems are presented, with a
particular focus on small universal Turing machines. These results are towards finding the …
particular focus on small universal Turing machines. These results are towards finding the …