scientific article; zbMATH DE number 512805

MaRDI QIDQ4281498zbMATH OpenFDO

Authors

Publication date 28 August 1994

zbMATH Keywords

abstract complexity theorydegree classdegrees of unsolvabilitygrowth rate of complexity boundspromptly simple degreesspeed-up theorem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3914306
• scientific article; zbMATH DE number 4081537
• scientific article; zbMATH DE number 3857081
• Degrees of unsolvability: a tutorial
• Some fundamental issues concerning degrees of unsolvability
• Generic Complexity of Undecidable Problems
• Generic complexity of undecidable problems
• An investigation on degrees of unsolvability
• scientific article; zbMATH DE number 3926899
• Undecidability in Some Structures Related to Computation Theory

Cited in

(4)

• ABSTRAKTE TEMPOMASZE UND SPEED‐UP‐THEOREMEA FÜR ENUMERATIONEN REKURSIV‐AUFZÄHLBARER MENGEN
• scientific article; zbMATH DE number 845602 (Why is no real title available?)
• Effective category and measure in abstract complexity theory
• Speed-ups by changing the order in which sets are enumerated (preliminary version)

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)