Kolmogorov complexity of enumerating finite sets

DOI10.1016/J.IPL.2007.01.006zbMATH Open1184.68277OpenAlexW1974750875MaRDI QIDQ2379938FDOQ2379938

Authors: Nikolai K. Vereshchagin 

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/12114

Recommendations

• Enumerations of the Kolmogorov function
• Enumerations including laconic enumerators
• Kolmogorov-Complexity Based on Infinite Computations
• On minimal-program complexity measures
• scientific article; zbMATH DE number 107774

zbMATH Keywords

randomized algorithmsKolmogorov complexitya priori probability

Mathematics Subject Classification ID

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

Cites Work

• Borel determinacy
• Title not available (Why is that?)
• Martin's game: a lower bound for the number of sets.

Cited In (3)

• Title not available (Why is that?)
• The deluge of spurious correlations in big data
• Probability and program-size for functions

This page was built for publication: Kolmogorov complexity of enumerating finite sets

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