On degrees of unsolvability and complexity properties

DOI10.2307/2271777MaRDI QIDQ4115141zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• On degrees of unsolvability
• On the degrees less than 0'

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4115141)