The Kleene Hierarchy Classification of Recursively Random Sequences

DOI10.2307/1994579zbMath0189.01101OpenAlexW4252945898MaRDI QIDQ5583065

Donald W. Loveland

Publication date: 1966

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

zbMATH Keywords

recursion theory, constructive mathematics

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing degrees of unsolvability
• Note on probability
• Ein Satz über die Elementar-Arithmetischen Definierbarkeitsklassen
• A New Interpretation of the von Mises' Concept of Random Sequence
• Trial and error predicates and the solution to a problem of Mostowski
• On the concept of a random sequence

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