2010 seminar talk: Algorithmic reducibilities of algebraic structures

Talk held by Iskander Kalimullin (Kazan State University) at the KGRC seminar on 2010-10-21.

Abstract

We will see how the notion of Medvedev's mass problem allows to extend the classical algorithmic reducibilities to the algebraic structures. In particular, the studies of degree spectra of structures can be considered as a development of the structural theory of the non-uniform reducibility of mass problems of presentability.

Bottom menu

Kurt Gödel Research Center for Mathematical Logic. Währinger Straße 25, 1090 Wien, Austria. Phone +43-1-4277-50501. Last updated: 2010-12-16, 04:37.