429 search results - page 19 / 86 » Noisy Turing Machines |
CVPR
2012
IEEE
11 years 9 months ago
2012
IEEE
While Boltzmann Machines have been successful at unsupervised learning and density modeling of images and speech data, they can be very sensitive to noise in the data. In this pap...
AB
2008
Springer
14 years 1 months ago
2008
Springer
We explore the computational power of biochemistry with respect to basic chemistry, identifying complexation as the basic mechanism that distinguishes the former from the latter. W...
CIE
2005
Springer
14 years 29 days ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
IJBC
2007
13 years 7 months ago
2007
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...
NIPS
2003
13 years 8 months ago
2003
This paper presents VLSI circuits with continuous-valued probabilistic behaviour realized by injecting noise into each computing unit(neuron). Interconnecting the noisy neurons fo...