The Friedberg-Muchnik Theorem Re-Examined

DOI10.4153/CJM-1972-110-4zbMath0225.02028MaRDI QIDQ5631091

Robert I. Soare

Publication date: 1972

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (14)

An extension of the nondiamond theorem in classical and α-recursion theory ⋮ Decidable subspaces and recursively enumerable subspaces ⋮ Completely mitotic r. e. degrees ⋮ On the Turing degrees of minimal index sets ⋮ Deficiency Sets and Bounded Information Reducibilities ⋮ Computational processes, observers and Turing incompleteness ⋮ STRUCTURAL HIGHNESS NOTIONS ⋮ Strength and Weakness in Computable Structure Theory ⋮ Definability of r. e. sets in a class of recursion theoretic structures ⋮ On btt-reducibilities. II ⋮ Post's problem and his hypersimple set ⋮ Extension theorems, orbits, and automorphisms of the computably enumerable sets ⋮ Recursively enumerable sets and degrees ⋮ Computational classification of cellular automata

This page was built for publication: The Friedberg-Muchnik Theorem Re-Examined