On degrees of unsolvability and complexity properties

DOI10.2307/2271777zbMath0346.02022OpenAlexW2113069034MaRDI QIDQ4115141

Ivan Marques

Publication date: 1976

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2271777

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (3)

Infimums of step-counting functions of enumeration of sets ⋮ Some lowness properties and computational complexity sequences ⋮ Classes of recursively enumerable sets and Q-reducibility

Cites Work

• Unnamed Item
• On the degrees less than 0'
• On degrees of unsolvability
• A Machine-Independent Theory of the Complexity of Recursive Functions

This page was built for publication: On degrees of unsolvability and complexity properties