We review the literature on universal computably enumerable equivalence relations (ceers) which are \(\Sigma ^0_1\)-complete with respect to computable reducibility on equivalence relation.Expand

We outline the general approach to the notion of a computable numeration in the frames of which computable numerations, of families of arithmetic sets are studied.

In recent years, classical computability has expanded beyond its original scope to address issues related to computability and complexity in algebra, analysis, and physics.Expand

Mass problems correspond to informal problems in the following sense: given any informal problem, a mass problem corresponding to it is a set of functions which "solve" the problem, and at least one such function can be "obtained" by any "solution" to the problem.Expand

We study computably enumerable equivalence relations (abbreviated as ceers) under computable reducibility, and investigate the resulting degree structure Ceers, which is a poset with a smallest and a greatest element.Expand