429 search results - page 13 / 86 » Noisy Turing Machines |
IJCAI
2007
13 years 8 months ago
2007
This goal of this paper is to defend the plausibility of the argument that passing the Turing test is a sufficient condition for the presence of intelligence. To this effect, we ...
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...