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

DOI10.1007/BF01698128MaRDI QIDQ4065032zbMATH OpenOpenAlexFDO

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

• scientific article; zbMATH DE number 3427210 (Why is no real title available?)
• scientific article; zbMATH DE number 3557225 (Why is no real title available?)
• scientific article; zbMATH DE number 3433226 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3307567 (Why is no real title available?)
• scientific article; zbMATH DE number 3034029 (Why is no real title available?)
• A New Interpretation of the von Mises' Concept of Random Sequence
• A unified approach to the definition of random sequences
• A variant of the Kolmogorov concept of complexity
• Almost Recursive Sets
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Logical basis for information theory and probability theory
• Minimal-program complexity of sequences with restricted resources
• On minimal-program complexity measures
• On the Length of Programs for Computing Finite Binary Sequences
• On the Length of Programs for Computing Finite Binary Sequences
• On the concept of a random sequence
• Retraceable Sets
• The definition of random sequences

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)