Recent and upcoming talks by Andre Nies

André Nies: Structure within the class of K-trivial sets

SEMINAR ANNOUNCEMENT Title: Structure within the class of K-trivial sets Prof. André Nies Department of Computer Science University of Auckland Date:    6 February 2017 (Monday) Time:      4.00pm – 5.00pm Venue:     MAS Executive Classroom 1 #03-06, School of Physical and Mathematical Sciences  and quantum settings The K-trivial sets are antirandom in the sense that the initial segment complexity in terms of prefix-free Kolmogorov complexity K grows as slowly as possible. continue reading…

Andre Nies: The complexity of isomorphism between profinite groups

Invitation to the Logic Seminar at the National University of Singapore Date: Thursday, 25 February 2016, 17:00 hrs Room: S17#04-06, Department of Mathematics, NUS Speaker: Andre Nies, The University of Auckland Title: The complexity of isomorphism between profinite groups URL: http://www.comp.nus.edu.sg/~fstephan/logicseminar.html A topological group G is profinite if it is compact and totally disconnected. continue reading…

Andre Nies: Algorithmic randomness connects to set theory

Monday, October 14, 2013, 16.30 Seminar room 0.011, Mathematical Institute, University of Bonn Speaker: Andre Nies (University of Auckland) Title: Algorithmic randomness connects to set theory Abstract: We discuss two connections between algorithmic randomness and set theory. continue reading…

The 13th Asian Logic Conference, September 16-20, 2013

The Thirteenth Asian Logic Conference will be held in Guangzhou from September 16 to 20, 2013. The Asian Logic Conference series is sponsored by the Association for Symbolic Logic and the meetings are major international events in mathematical logic. continue reading…