Relativized Schnorr tests with universal behavior

DOI10.1007/s00153-010-0187-6zbMath1192.03018OpenAlexW2049178364MaRDI QIDQ982185

Nicholas Rupprecht

Publication date: 6 July 2010

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-010-0187-6

zbMATH Keywords

forcingcardinal characteristiccomputably traceableSchnorr nullSchnorr test

Mathematics Subject Classification ID

Cardinal characteristics of the continuum (03E17) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)

Related Items (6)

Covering the Recursive Sets ⋮ MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY ⋮ Weakly Represented Families in Reverse Mathematics ⋮ Covering the recursive sets ⋮ MUCHNIK DEGREES AND CARDINAL CHARACTERISTICS ⋮ Computable analogs of cardinal characteristics: prediction and rearrangement

Cites Work

• Unnamed Item
• Unnamed Item
• Lowness for genericity
• A mathematical proof of S. Shelah's theorem on the measure problem and related results
• Process complexity and effective random tests
• Computational randomness and lowness
• Combinatorial Cardinal Characteristics of the Continuum
• Schnorr dimension
• Additivity of Measure Implies Dominating Reals
• Von Mises' definition of random sequences reconsidered
• Combinatorial aspects of measure and category
• Strong measure zero sets without Cohen reals
• Schnorr randomness
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• The definition of random sequences
• ∏ 0 1 Classes and Degrees of Theories
• Randomness, relativization and Turing degrees
• Eine Äquivalenz zwischen der Kontniuumhypotlhese und der Existenz der Lusinschen und Sierpińskischen Mengen
• Theory and Applications of Models of Computation

This page was built for publication: Relativized Schnorr tests with universal behavior