General random sequences and learnable sequences

DOI10.2307/2272862zbMath0376.02026OpenAlexW1996707648MaRDI QIDQ4154541

P. H. Fuchs, Claus Peter Schnorr

Publication date: 1978

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) General topics in the theory of software (68N01) Axioms; other general questions in probability (60A05)

Related Items

Randomness extraction in computability theory ⋮ On the notion of infinite pseudorandom sequences ⋮ An almost machine-independent theory of program-length complexity, sophistication, and induction ⋮ Continuous randomness via transformations of 2-random sequences ⋮ Schnorr randomness for noncomputable measures ⋮ Research in the theory of inductive inference by GDR mathematicians - A survey ⋮ Strong reductions in effective randomness ⋮ On the inference of optimal descriptions ⋮ Computable randomness and betting for computable probability spaces

Cites Work

• Process complexity and effective random tests
• A Machine-Independent Theory of the Complexity of Recursive Functions
• [https://portal.mardi4nfdi.de/wiki/Publication:5581622 Eine Bemerkung zum Begriff der zuf�lligen Folge]
• On Effective Procedures for Speeding Up Algorithms
• A unified approach to the definition of random sequences

This page was built for publication: General random sequences and learnable sequences