Almost all formal theories of intelligence suffer from the problem of logical omniscience, the assumption that an agent already knows all consequences of its beliefs. Logical uncertainty codifies uncertainty about the consequences of existing beliefs. This implies a departure from beliefs governed by standard probability theory. Here, we study the asymptotic properties of beliefs on quickly computable sequences of logical sentences. Motivated by an example we call the Benford test, we provide an approach which identifies when such subsequences are indistinguishable from random, and learns their probabilities.
CITATION STYLE
Garrabrant, S., Benson-Tilsen, T., Bhaskar, S., Demski, A., Garrabrant, J., Koleszarik, G., & Lloyd, E. (2016). Asymptotic logical uncertainty and the Benford test. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9782, pp. 202–211). Springer Verlag. https://doi.org/10.1007/978-3-319-41649-6_20
Mendeley helps you to discover research relevant for your work.