10 citations · 19 across the 3 of their papers we have counts for
3 papers
A Formal Approach to the Problem of Logical Non-Omniscience
Scott Garrabrant, Tsvi Benson-Tilsen, Andrew Critch +2
We present the logical induction criterion for computable algorithms that assign probabilities to every logical statement in a given formal language, and refine those probabilities…
Logical Induction
Scott Garrabrant, Tsvi Benson-Tilsen, Andrew Critch +2
We present a computable algorithm that assigns probabilities to every logical statement in a given formal language, and refines those probabilities over time. For instance, if the…
Asymptotic Logical Uncertainty and The Benford Test
Scott Garrabrant, Siddharth Bhaskar, Abram Demski +3
We give an algorithm A which assigns probabilities to logical sentences. For any simple infinite sequence of sentences whose truth-values appear indistinguishable from a biased coi…