The limit of prediction and randomness
Talk at CS seminar in RIMS, Kyoto University on 26 Apr 2012.
The former half is about the relation between differentiability and randomness.
I talk about why more computability is needed to characterize Schnorr randomness by differentiability.
The latter half is about the relation between Solomonoff’s induction and the differentiability.
I use a little different setting from Solomonoff’s induction to get a Schnorr randomness version
with long prediction.
I talk more about future work.
Slide in Japanese