1 citations · 2 across the 4 of their papers we have counts for
4 papers
Algorithmic randomness and the weak merging of computable probability measures
Simon M. Huttegger, Sean Walsh, Francesca Zaffora Blando
We characterize Martin-Löf randomness and Schnorr randomness in terms of the merging of opinions, along the lines of the Blackwell-Dubins Theorem. After setting up a general framew…
Schnorr Randomness and Effective Bayesian Consistency and Inconsistency
Simon M. Huttegger, Sean Walsh, Francesca Zaffora Blando
We study Doob's Consistency Theorem and Freedman's Inconsistency Theorem from the vantage point of computable probability and algorithmic randomness. We show that the Schnorr rando…
Simply-typed constant-domain modal lambda calculus I: distanced beta reduction and combinatory logic
Sean Walsh
A system is developed that combines modal logic and simply-typed lambda calculus, and that generalizes the system studied by Montague and Gallin. Whereas Montague…
Algorithmic Randomness, Effective Disintegrations, and Rates of Convergence to the Truth
Simon M. Huttegger, Sean Walsh, Francesca Zaffora Blando
Lévy's Upward Theorem says that the conditional expectation of an integrable random variable converges with probability one to its true value with increasing information. In this p…