![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Tomasz Steifer (Pontificia Universidad Católica de Chile, Polish Academy of Sciences)
Friday 10 June 2022, 13:30-14:30
Learning and randomness
⚠️ Important: SASW09 - International conference on computability, complexity and randomness
- 👤 Speaker: Tomasz Steifer (Pontificia Universidad Católica de Chile, Polish Academy of Sciences)
- 📅 Date & Time: Friday 10 June 2022, 13:30 - 14:30
- 📍 Venue: Seminar Room 1, Newton Institute
Questions? Contact
the organiser
Abstract
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.
Series This talk is part of the Isaac Newton Institute Seminar Series series.
Included in Lists
- All CMS events
- bld31
- dh539
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
Note: Ex-directory lists are not shown.