Sharpening Occam's razor
type: Item
instance of: scholarly article
title: Sharpening Occam's razor
zbMATH Open document ID: 1173.68886
DOI: 10.1016/S0020-0190(02)00427-1
author: Ming Li
author: John Tromp
author: Paul M. B. Vitányi
published in: Information Processing Letters
publication date: 2009-03-23T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68T01
zbMATH DE Number: 5530888
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: pac-learning
zbMATH Keywords: Kolmogorov complexity
zbMATH Keywords: Occam's razor-style theorems
MaRDI profile type: Publication
cites work: Q4004178
cites work: Linear approximation of shortest superstrings
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Occam's razor
cites work: A general lower bound on the number of examples needed for learning
cites work: Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
cites work: Predicting \(\{ 0,1\}\)-functions on randomly drawn points
cites work: On weak learning
cites work: DNA sequencing and string learning
cites work: Q4337021
cites work: Q5386442
cites work: A theory of the learnable
description: scientific article; zbMATH DE number 5530888