no code implementations • 16 Sep 2016 • Jan Leike, Jessica Taylor, Benya Fallenstein
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.
no code implementations • 12 Sep 2016 • Scott Garrabrant, Tsvi Benson-Tilsen, Andrew Critch, Nate Soares, Jessica Taylor
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.
no code implementations • 18 Apr 2016 • Scott Garrabrant, Nate Soares, Jessica Taylor
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.
no code implementations • 17 Aug 2015 • Benja Fallenstein, Jessica Taylor, Paul F. Christiano
This can be seen as providing a foundation for classical game theory in which players aren't special.