Recursive computational depth

DOI10.1007/3-540-63165-8_171MaRDI QIDQ4571946zbMATH OpenOpenAlexFDO

Authors James I. Lathrop, Jack H. Lutz

Publication date 4 July 2018

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63165-8_171

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Recursive computational depth.
• Computational depth and reducibility
• Computational depth and reducibility
• Weakly useful sequences
• Weakly useful sequences

Cites work

• scientific article; zbMATH DE number 193560 (Why is no real title available?)
• scientific article; zbMATH DE number 969633 (Why is no real title available?)
• A formal theory of inductive inference. Part I
• A unified approach to the definition of random sequences
• Almost everywhere high nonuniform complexity
• Computational depth and reducibility
• The definition of random sequences
• Von Mises' definition of random sequences reconsidered
• Weakly useful sequences
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)

Cited in

(10)

• Weakly useful sequences
• A general notion of useful information
• Computational depth and reducibility
• Relativized depth
• Recursive computational depth.
• Natural complexity, computational complexity and depth
• Computing Depths of Patterns
• Weakly useful sequences
• Computational depth and reducibility
• The Recursive Core

This page was built for publication: Recursive computational depth

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