Strong and weak reducibility of algorithmic problems1

DOI10.3233/COM-150042zbMath1347.03079OpenAlexW1422201042MaRDI QIDQ2799750

A. A. Muchnik

Publication date: 13 April 2016

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/com-150042

zbMATH Keywords

weak reducibilityex-problemsM-problemsweak degrees

Mathematics Subject Classification ID

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

Cites Work

• Zur Deutung der intuitionistischen Logik
• The upper semi-lattice of degrees of recursive unsolvability
• Recursively enumerable sets of positive integers and their decision problems
• Unnamed Item

This page was built for publication: Strong and weak reducibility of algorithmic problems1