Minimal-program complexity of pseudo-recursive and pseudo-random sequences

DOI10.1007/BF01698128zbMATH Open0307.68033OpenAlexW2076093366MaRDI QIDQ4065032FDOQ4065032

Authors: Robert P. Daley 

Publication date: 1975

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01698128

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computability and recursion theory (03D99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Length of Programs for Computing Finite Binary Sequences
• Title not available (Why is that?)
• The definition of random sequences
• On the Length of Programs for Computing Finite Binary Sequences
• Logical basis for information theory and probability theory
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• A unified approach to the definition of random sequences
• A variant of the Kolmogorov concept of complexity
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the concept of a random sequence
• Title not available (Why is that?)
• Retraceable Sets
• A New Interpretation of the von Mises' Concept of Random Sequence
• Minimal-program complexity of sequences with restricted resources
• On minimal-program complexity measures
• Almost Recursive Sets

Cited In (3)

• The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
• The Kolmogorov complexity of infinite words
• The complexity of stochastic sequences

This page was built for publication: Minimal-program complexity of pseudo-recursive and pseudo-random sequences

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