Avoiding coding tricks by hyperrobust learning
type: Item
instance of: scholarly article
title: Avoiding coding tricks by hyperrobust learning
zbMATH Open document ID: 0997.68097
DOI: 10.1016/S0304-3975(01)00086-X
author: Matthias Ott
author: Frank Stephan
published in: Theoretical Computer Science
publication date: 2002-07-15T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1767826
zbMATH Keywords: hyperrobust learning
zbMATH Keywords: learnability
zbMATH Keywords: BC-learning
MaRDI profile type: Publication
cites work: Toward a mathematical theory of inductive inference
cites work: Robust learning aided by context
cites work: Learning recursive functions from approximations
cites work: Comparison of identification criteria for machine inductive inference
cites work: Some decidability results on grammatical inference and complexity
cites work: Robust separations in inductive inference
cites work: Some natural properties of strong-identification in inductive inference
cites work: Classical recursion theory. The theory of functions and sets of natural numbers
cites work: Probabilistic inductive inference
cites work: Probability and plurality for aggregations of learning machines
cites work: Q4096931
cites work: The Power of Pluralism for Automatic Program Synthesis
cites work: ON THE NONBOUNDABILITY OF TOTAL EFFECTIVE OPERATORS
cites work: Q3790671
description: scientific article; zbMATH DE number 1767826