Abstract

Brattka, Miller and Nies (2012) showed that some major algorithmic randomness notions are characterized via differentiability. The main goal of this paper is to characterize Kurtz randomness by a differentiation theorem on a computable metric space. The proof shows that integral tests play an essential part and shows that how randomness and differentiation are connected.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call