Asymptotic Logical Uncertainty and The Benford Test
Machine Learning
2015-10-13 v1 Artificial Intelligence
Abstract
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.
Keywords
Cite
@article{arxiv.1510.03370,
title = {Asymptotic Logical Uncertainty and The Benford Test},
author = {Scott Garrabrant and Siddharth Bhaskar and Abram Demski and Joanna Garrabrant and George Koleszarik and Evan Lloyd},
journal= {arXiv preprint arXiv:1510.03370},
year = {2015}
}