The Kleene Hierarchy Classification of Recursively Random Sequences

DOI10.2307/1994579MaRDI QIDQ5583065zbMATH OpenOpenAlexFDO

Authors Donald W. Loveland

Publication date 1966

Full work available at URL https://doi.org/10.2307/1994579

zbMATH Keywords

recursion theory, constructive mathematics

Cites work

• scientific article; zbMATH DE number 3126031 (Why is no real title available?)
• scientific article; zbMATH DE number 3131080 (Why is no real title available?)
• scientific article; zbMATH DE number 3132222 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• A New Interpretation of the von Mises' Concept of Random Sequence
• Computing degrees of unsolvability
• Ein Satz über die Elementar-Arithmetischen Definierbarkeitsklassen
• Note on probability
• On the concept of a random sequence
• Trial and error predicates and the solution to a problem of Mostowski

Cited in

(4)

• Merging sequential e-values via martingales
• The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
• The dimensions of individual strings and sequences
• Feasible reductions to Kolmogorov-Loveland stochastic sequences

This page was built for publication: The Kleene Hierarchy Classification of Recursively Random Sequences

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