315 search results - page 13 / 63 » Reactive Turing Machines |
COLT
2008
Springer
13 years 9 months ago
2008
Springer
We show that randomly generated monotone c log(n)-DNF formula can be learned exactly in probabilistic polynomial time. Our notion of randomly generated is with respect to a unifor...
JIFS
2002
13 years 7 months ago
2002
A novel way to simulate Turing Machines (TMs) by Artificial Neural Networks (ANNs) is proposed. We claim that the proposed simulation is in agreement with the correct interpretatio...
COLT
2000
Springer
13 years 11 months ago
2000
Springer
Good-Turing adjustments of word frequencies are an important tool in natural language modeling. In particular, for any sample of words, there is a set of words not occuring in tha...
FOSSACS
2011
Springer
12 years 11 months ago
2011
Springer
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of...
TAMC
2009
Springer
14 years 1 months ago
2009
Springer
Computability concerns information with a causal – typically algorithmic – structure. As such, it provides a schematic analysis of many naturally occurring situations. We look ...