429 search results - page 27 / 86 » Noisy Turing Machines |
142
click to vote
Publication
A number of authentication protocols have been proposed recently, where at least some part of the authentication is performed during a phase, lasting $n$ rounds, with no error corr...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and ...
112
click to vote
AI
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. Subspace mapping methods aim at projecting high-dimensional data into a subspace where a specific objective function is optimized. Such dimension reduction allows the re...
ALT
1998
Springer
15 years 1 months ago
1998
Springer
An index for an r.e. class of languages (by definition) generates a sequence of grammars defining the class. An index for an indexed family of recursive languages (by definition) ...
NC
2006
14 years 9 months ago
2006
Biochemical reactions taking place in living systems that map different inputs to specific outputs are intuitively recognized as performing information processing. Conventional wis...