LGOct 12, 2015
Asymptotic Logical Uncertainty and The Benford TestScott Garrabrant, Siddharth Bhaskar, Abram Demski et al.
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 coin that outputs "true" with probability p, we have that the sequence of probabilities that A assigns to these sentences converges to p.