On degrees of unsolvability and complexity properties

DOI10.2307/2271777zbMATH Open0346.02022OpenAlexW2113069034MaRDI QIDQ4115141FDOQ4115141

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

• Title not available (Why is that?)
• 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)