ELC Seminar
Monday 1 pm, May 20, 2013
Seminar room, ELC Centre, 5th floor of Tokyo Institute of Technology Tamachi office
http://www.al.ics.saitama-u.ac.jp/elc/en/?celc

Algorithmically random infinite structures
Bakhadyr Khoussainov (University of Auckland)

The last two decades have witnessed significant advances in the
investigation of algorithmic randomness of infinite strings.
Monographs by Downey and Hirschfeldt, and by Nies account for the
recent research activities in the area.  In spite of much work,
research on randomness of infinite strings has excluded the
investigation of algorithmic randomness for infinite algebraic
structures such graphs, trees, groups or more generally universal
algebras.  In this talk, we provide a framework for reasoning about
algorithmic randomness for various classes of infinite structures.

問合せ先：河村（A01班）