[logic-ml] Seminar (Bakhadyr Khoussainov), Mon May 20, Tamachi

[Akitoshi Kawamura]

皆様

東大の河村です
お世話になっております

直前の御連絡ですみませんが
20日（月）の講演会の御案内です
どうぞお越し下さい

--
河村彰星
東京大学大学院情報理工学系研究科コンピュータ科学専攻
助教（今井研究室）
03-5841-4097
http://www-imai.is.s.u-tokyo.ac.jp/~kawamura/index_j.html



ELC Seminar
http://www.al.ics.saitama-u.ac.jp/elc/event/list.cgi?regid=20130520-0000-20130520--20130515-164112-865
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.