From the 1 of 3 linked papers with an AI index.
1 citations · 1 across the 1 of their papers we have counts for
3 papers
Simply-typed constant-domain modal lambda calculus I: distanced beta reduction and combinatory logic
Sean Walsh
The paper introduces a simply‑typed modal lambda calculus (λ_θ) that extends Montague and Gallin’s system with a configurable parameter for state types, and develops its metatheory…
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 frame…
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…