Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
The Medvedev lattice of degrees of difficulty
Computability, enumerability, unsolvability
Hi-index | 0.00 |
We show that the first order theories of the Medevdev lattice and the Muchnik lattice are both computably isomorphic to the third order theory of the natural numbers.