Asymptotic Logical Uncertainty and The Benford Test
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- October 2015
- arXiv:
- arXiv:1510.03370
- Bibcode:
- 2015arXiv151003370G
- Keywords:
-
- Computer Science - Machine Learning;
- Computer Science - Artificial Intelligence;
- F.4.1