[Todos] Seminario de Probabilidad

[Matthieu Jonckheere]

PROXIMO ENCUENTRO: Miércoles 5 de Junio, 12:00hs.

EXPOSITOR: Joseph Miller

TITULO:  An introduction to algorithmic randomness

LUGAR: Departamento de Matemática, Aula de seminarios, 2do piso, Pabellón 1.

RESUMEN:
Various attempts have been made to give meaning to the idea that an
individual binary sequence is random, starting with Von Mises in 1919.
He gave the first published axiomatization of probability theory,
basing it on a distinguished family of random sequences. The modern
approach to defining randomness for individual sequences is rooted
Kolmogorov's definition of the complexity of a finite binary string.
Kolmogorov complexity is closely related to the most robust notion of
randomness for infinite binary sequences, given by Martin-Löf. I will
introduce these notions and talk about how they interact with
computability theory (my field of study), analysis, and our intuitions
about randomness.
------------ próxima parte ------------
Se ha borrado un adjunto en formato HTML...
URL: http://mail.df.uba.ar/pipermail/todos/attachments/20130604/d462de7c/attachment.html