Arithmetical Measure

DOI10.1002/malq.19980440211zbMath0898.03017OpenAlexW4237105374MaRDI QIDQ4393174

Sebastiaan A. Terwijn, Leen Torenvliet

Publication date: 1 November 1998

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

Full work available at URL: https://doi.org/10.1002/malq.19980440211

zbMATH Keywords

Martin-Löf randomnessrecursive randomnessmeasure zero setreducibilitiesresource bounded measuresarithmetical measurerandom infinite sequence

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other degrees and reducibilities in computability and recursion theory (03D30) Classical measure theory (28A99) Hierarchies of computability and definability (03D55)

Related Items (2)

A MINIMAL PAIR IN THE GENERIC DEGREES ⋮ Weakly useful sequences

Cites Work

• Unnamed Item
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)

This page was built for publication: Arithmetical Measure