On the necessity of Occam algorithms
type: Item
instance of: scholarly article
title: On the necessity of Occam algorithms
zbMATH Open document ID: 0825.68544
DOI: 10.1016/0304-3975(92)90367-O
author: Raymond Board
author: Leonard Pitt
published in: Theoretical Computer Science
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 64920
MaRDI profile type: Publication
cites work: Q4013524
cites work: Occam's razor
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: A general lower bound on the number of examples needed for learning
cites work: Computational Complexity of Probabilistic Turing Machines
cites work: Computational limitations on learning from examples
cites work: Prediction-preserving reducibility
cites work: The minimum consistent DFA problem cannot be approximated within any polynomial
cites work: A theory of the learnable
full work available at URL: 0304-3975(92)90367-o
OpenAlex ID: W2075121617
description: scientific article; zbMATH DE number 64920