Publication:4348125
From MaRDI portal
zbMath0885.03041MaRDI QIDQ4348125
Publication date: 31 March 1998
survey; rigidity; automorphisms; Turing reducibility; computably enumerable degrees; Turing degrees; Turing definability; degrees of unsolvability; biinterpretability; relative Turing computability
03D25: Recursively (computably) enumerable sets and degrees