Two Problems for Sophistication

DOI10.1007/978-3-319-24486-0_25MaRDI QIDQ2835644zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Peter Bloem, Steven de Rooij, Pieter Adriaans

Publication date 30 November 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-24486-0_25

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• On two problems
• Two almost easy problems
• scientific article; zbMATH DE number 3163842
• Two Problems of Induction
• Two Problems of Induction
• Two Problems of Dowker
• scientific article; zbMATH DE number 5545661

Cites work

• scientific article; zbMATH DE number 3860059 (Why is no real title available?)
• scientific article; zbMATH DE number 107774 (Why is no real title available?)
• scientific article; zbMATH DE number 1979532 (Why is no real title available?)
• scientific article; zbMATH DE number 2116058 (Why is no real title available?)
• A safe approximation for Kolmogorov complexity
• Algorithmic statistics
• An almost machine-independent theory of program-length complexity, sophistication, and induction
• Computational depth: Concept and applications
• Information measures, effective complexity, and total information
• Kolmogorov's Structure Functions and Model Selection
• On notation for ordinal numbers
• Sophistication as randomness deficiency
• Sophistication revisited
• Sophistication vs logical depth

Cited in

(7)

• Sophistication revisited
• scientific article; zbMATH DE number 2038716 (Why is no real title available?)
• Sophistication as randomness deficiency
• Cognition and complexity
• The complexity of information extraction
• Real patterns and indispensability
• Two measures of difficulty

This page was built for publication: Two Problems for Sophistication

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