Two Problems for Sophistication

DOI10.1007/978-3-319-24486-0_25zbMATH Open1471.68096DBLPconf/alt/BloemRA15OpenAlexW2295601141WikidataQ54839670 ScholiaQ54839670MaRDI QIDQ2835644FDOQ2835644

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

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

Mathematics Subject Classification ID

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

Cites Work

• An almost machine-independent theory of program-length complexity, sophistication, and induction
• Title not available (Why is that?)
• Kolmogorov's Structure Functions and Model Selection
• Algorithmic statistics
• On notation for ordinal numbers
• Title not available (Why is that?)
• Information measures, effective complexity, and total information
• Sophistication revisited
• Computational depth: Concept and applications
• Title not available (Why is that?)
• Sophistication vs logical depth
• Title not available (Why is that?)
• Sophistication as randomness deficiency
• A safe approximation for Kolmogorov complexity

Cited In (7)

• Sophistication revisited
• Title not available (Why is that?)
• 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)