911 search results - page 30 / 183 » Kolmogorov Complexity Cores |
100
click to vote
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...
103
click to vote
ECAI
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. This paper presents an approach for reasoning about action and change which appeals to the principle of Occam’s razor— roughly stating that the simplest explanations ...
108
click to vote
PRICAI
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In this paper we address the problem of commonsense reasoning about action by appealing to Occam’s razor—we should accept the simplest hypothesis explaining the obser...
131
click to vote
AGI
2008
15 years 3 months ago
2008
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
116
click to vote
NIPS
2003
15 years 3 months ago
2003
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...