Sciweavers

Share
49 search results - page 1 / 10
» Is There an Elegant Universal Theory of Prediction?
Sort
View
ALT
2003
Springer
12 years 8 months ago
On the Existence and Convergence of Computable Universal Priors
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...
Marcus Hutter
ICML
1999
IEEE
13 years 14 days ago
Machine-Learning Applications of Algorithmic Randomness
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...
Volodya Vovk, Alexander Gammerman, Craig Saunders
STOC
2000
ACM
55views Algorithms» more  STOC 2000»
12 years 4 months ago
Self-testing of universal and fault-tolerant sets of quantum gates
We consider the design of self-testers for quantum gates. A self-tester for the gates F 1, . . . , F m is a procedure that, given any gates G1, . . . , Gm, decides with high probab...
Wim van Dam, Frédéric Magniez, Miche...
CORR
2008
Springer
103views Education» more  CORR 2008»
11 years 11 months ago
Executable Set Theory and Arithmetic Encodings in Prolog
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic...
Paul Tarau
books