University of Cambridge > > Isaac Newton Institute Seminar Series > Learning and randomness

Learning and randomness

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact nobody.

SASW09 - International conference on computability, complexity and randomness

Recently, a connection has been established between two branches of the computability theory, namely between algorithmic randomness and algorithmic learning theories. Learning-theoretical characterizations of several notions of randomness were discovered.  We study such characterizations based on the asymptotic density of positive answers. Then we discuss the close relation between learning and convergence of computable functions on algorithmically random points.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity