“Helping”: several formalizations

DOI10.2307/2271779zbMath0342.02025OpenAlexW1972026679MaRDI QIDQ4109657

Nancy A. Lynch

Publication date: 1976

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items

Characterization of realizable space complexities ⋮ Computational complexity of functions ⋮ The complexity types of computable sets ⋮ Robust algorithms: a different approach to oracles ⋮ On some natural complete operators ⋮ Relativization of the Theory of Computational Complexity

Cites Work

• Unnamed Item
• Unnamed Item
• A Machine-Independent Theory of the Complexity of Recursive Functions