Monthly Archives: January 2012
The result in this paper was included in L1-computability, layerwise computability and Solovay reducibility
Jan 26, 2012, Submitted to a conference
An integral test for Schnorr randomness and its application
The author proposed in the previous paper that a characterization of a randomness notion by integral tests is a useful tool to study the relation between algorithmic randomness and computable analysis. In this paper we give a version of Schnorr randomness. With this result we show the connection between L1-computability and Schnorr layerwise computability. Finally we apply them to study the points on which two Radon-Nikodym derivatives are equal.
An introduction to algorithmic randomness
Talk at GCOE tea time on 10 Jan 2012.