Computably enumerable equivalence relations

KGRC Research Seminar | 04.12.2014 15:00 - 16:30

S. Badaev (Al-Farabi Kazakh National U, Almaty, KZ)

I am going to remind (introduce) some classes of computably enumerable relations that are related to the idea of fixed point such as precomplete, weakly precomplete, uniformly finitely precomplete. These relations are considered with respect to m-reducibility. Some new joint results with Andrea Sorbi on interrelations of the mentioned above classes will be presented.

Organiser:

KGRC

Location:

SR 101, 2. St., Währinger Str. 25