English

Schnorr randomness for noncomputable measures

Logic 2017-08-08 v3

Abstract

This paper explores a novel definition of Schnorr randomness for noncomputable measures. We say xx is uniformly Schnorr μ\mu-random if t(μ,x)<t(\mu,x)<\infty for all lower semicomputable functions t(μ,x)t(\mu,x) such that μt(μ,x)dμ(x)\mu\mapsto\int t(\mu,x)\,d\mu(x) is computable. We prove a number of theorems demonstrating that this is the correct definition which enjoys many of the same properties as Martin-L\"of randomness for noncomputable measures. Nonetheless, a number of our proofs significantly differ from the Martin-L\"of case, requiring new ideas from computable analysis.

Keywords

Cite

@article{arxiv.1607.04679,
  title  = {Schnorr randomness for noncomputable measures},
  author = {Jason Rute},
  journal= {arXiv preprint arXiv:1607.04679},
  year   = {2017}
}
R2 v1 2026-06-22T14:56:10.780Z