Improved learning from Kolmogorov complexity

DOI10.4230/LIPICS.CCC.2023.12MaRDI QIDQ6640347zbMATH OpenFDO

Authors Halley Goldberg, Valentine Kabanets

Publication date 19 November 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CCC.2023.12

zbMATH Keywords

average-case complexityKolmogorov complexitylearningmeta-complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(1)

• Distributional PAC-learning from Nisan's natural proofs

This page was built for publication: Improved learning from Kolmogorov complexity

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