3 research outputs found
Computable Measure Theory and Algorithmic Randomness
International audienceWe provide a survey of recent results in computable measure and probability theory, from both the perspectives of computable analysis and algorithmic randomness, and discuss the relations between them
Schnorr randomness for noncomputable measures
Schnorr randomness is a randomness notion based on Brouwer's concept of a "constructive null set." Recently, Schnorr randomness has been closely associated with a number of theorems in computable analysis, including the Lebesgue differentiation theorem, the ergodic theorem (for ergodic measures), and Carleson's theorem. Nonetheless, the theory of Schnorr randomness is not nearly as developed as that of Martin-Löf randomness. In particular, there is no established notion of Schnorr randomness with respect to noncomputable measures. Such a notion would be essential to applying Schnorr randomness to disintegration theorems such as de Finetti's theorem or the ergodic decomposition theorem.
In this talk I will present a novel definition of Schnorr randomness for noncomputable measures. Say that is \emph{Schnorr random with respect to} a (possibly noncomputable) measure if for all lower semicomputable functions such that is finite and computable. I will show that this definition satisfies the basic properties that one would expect such a notion to have.
I will also present various applications of this definition, and discuss how it fits into a larger research program.Non UBCUnreviewedAuthor affiliation: Pennsylvania State UniversityPostdoctora