Search Results for author:
Found 4 papers, 0 papers with code
A Formal Solution to the Grain of Truth Problem
In this paper we present a formal and general solution to the full grain of truth problem: we construct a class of policies that contains all computable policies as well as Bayes-optimal policies for every lower semicomputable prior over the class.
Logical Induction
For instance, if the language is Peano arithmetic, it assigns probabilities to all arithmetical statements, including claims about the twin prime conjecture, the outputs of long-running computations, and its own probabilities.
Asymptotic Convergence in Online Learning with Unbounded Delays
We study the problem of predicting the results of computations that are too expensive to run, via the observation of the results of smaller computations.
Reflective Oracles: A Foundation for Classical Game Theory
This can be seen as providing a foundation for classical game theory in which players aren't special.
