11 search results - page 1 / 3 » Universal Recursively Enumerable Sets of Strings |
DLT
2008
13 years 6 months ago
2008
The present work clarifies the relation between domains of universal machines and r.e. prefix-free supersets of such sets. One such characterisation can be obtained in terms of the...
MCU
2004
13 years 6 months ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
SYNASC
2005
IEEE
13 years 10 months ago
2005
IEEE
We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursivel...
NC
2008
13 years 5 months ago
2008
We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems...
COLT
1992
Springer
13 years 9 months ago
1992
Springer
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...