Asymptotic Logical Uncertainty and The Benford Test
classification
💻 cs.LG
cs.AI
keywords
sentencesassignslogicalprobabilitiessequencealgorithmappearasymptotic
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.