2000 character limit reached
Asymptotic Logical Uncertainty and The Benford Test
Published 12 Oct 2015 in cs.LG and cs.AI | (1510.03370v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.