114 citations · 157 across the 12 of their papers we have counts for
Showing 2002Show all
2 papers · 1 filter
cs.CC2002
The Fastest and Shortest Algorithm for All Well-Defined Problems
Marcus Hutter
An algorithm is described that solves any well-defined problem as quickly as the fastest algorithm computing a solution to , save for a factor of 5 and low-order additiv…
cs.AI2002
Self-Optimizing and Pareto-Optimal Policies in General Environments based on Bayes-Mixtures
Marcus Hutter
The problem of making sequential decisions in unknown probabilistic environments is studied. In cycle action results in perception and reward , where all quant…