The Kleene Hierarchy Classification of Recursively Random Sequences

DOI10.2307/1994579zbMATH Open0189.01101OpenAlexW4252945898MaRDI QIDQ5583065FDOQ5583065

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Trial and error predicates and the solution to a problem of Mostowski
• Title not available (Why is that?)
• On the concept of a random sequence
• Computing degrees of unsolvability
• A New Interpretation of the von Mises' Concept of Random Sequence
• Note on probability
• Ein Satz über die Elementar-Arithmetischen Definierbarkeitsklassen

Cited In (4)

• The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
• The dimensions of individual strings and sequences
• Merging sequential e-values via martingales
• 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)