scientific article; zbMATH DE number 512805

zbMATH Open0794.03057MaRDI QIDQ4281498

Author name not available (Why is that?)

Publication date: 28 August 1994

Title of this publication is not available (Why is that?)

zbMATH Keywords

degrees of unsolvabilitypromptly simple degreesspeed-up theoremabstract complexity theorydegree classgrowth rate of complexity bounds

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• An investigation on degrees of unsolvability 👍 👎
• Degrees of Unsolvability: A Tutorial 👍 👎
• Generic Complexity of Undecidable Problems 👍 👎
• Generic complexity of undecidable problems 👍 👎
• Undecidability in Some Structures Related to Computation Theory 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

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