scientific article; zbMATH DE number 5354051

MaRDI QIDQ3530400zbMATH OpenFDO

Authors André Nies

Publication date 20 October 2008

zbMATH Keywords

surveyrandomness

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80)

Recommendations

• scientific article; zbMATH DE number 1614705
• Elimination of conditions
• The elimination of De Re modalities
• Elimination methods
• Reflections on elimination theory
• scientific article; zbMATH DE number 1670493
• EG-eliminations
• Eliminating ditransitives
• Eliminating disjunctions by disjunction elimination
• Eliminating disjunctions by disjunction elimination

Cited in

(4)

• Strong jump-traceability
• Inherent enumerability of strong jump-traceability
• Non-cupping and randomness
• 𝐾-trivial degrees and the jump-traceability hierarchy

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