1414 search results - page 1 / 283 » Randomness and Universal Machines |
ALT
2004
Springer
14 years 2 months ago
2004
Springer
CCA
2005
Springer
13 years 11 months ago
2005
Springer
ICML
1999
IEEE
14 years 6 months ago
1999
IEEE
Most machine learning algorithms share the following drawback: they only output bare predictions but not the con dence in those predictions. In the 1960s algorithmic information t...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
ENTCS
2007
13 years 5 months ago
2007
We present the SQRAM architecture for quantum computing, which is based on Knill’s QRAM model. We detail a suitable instruction set, which implements a universal set of quantum ...