Maximal machine learnable classes
type: Item
instance of: scholarly article
title: Maximal machine learnable classes
zbMATH Open document ID: 0938.68084
author: John Case
author: Mark A. Fulk
published in: Journal of Computer and System Sciences
publication date: 1999-09-22T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1343339
zbMATH Keywords: machine learnable classes
MaRDI profile type: Publication
full work available at URL: jcss.1997.1518
OpenAlex ID: W2066256185
cites work: Learnability: Admissible, co-finite, and hypersimple languages
cites work: Toward a mathematical theory of inductive inference
cites work: Infinitary self-reference in learning theory
cites work: The Power of Vacillation in Language Learning
cites work: Q4300060
cites work: Q3704910
cites work: Comparison of identification criteria for machine inductive inference
cites work: Saving the phenomena: Requirements that inductive inference machines not contradict known data
cites work: Robust separations in inductive inference
cites work: Language identification in the limit
cites work: Q4153600
cites work: Some natural properties of strong-identification in inductive inference
cites work: Criteria of language learning
cites work: Q5533181
cites work: The independence of control structures in abstract programming systems
cites work: Gödel numberings of partial recursive functions
cites work: Q5573961
cites work: Q3325707
cites work: A connotational theory of program structure
cites work: Q4310702
DOI: 10.1006/JCSS.1997.1518
description: scientific article; zbMATH DE number 1343339