On the structure of degrees of inferability.

DOI10.1006/JCSS.1996.0018zbMATH Open1152.68452OpenAlexW4213286322MaRDI QIDQ960466FDOQ960466

Frank Stephan, Martin Kummer

Publication date: 21 December 2008

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1996.0018

zbMATH Keywords

degrees of inferabilityinductive inference machines

Mathematics Subject Classification ID

Computational learning theory (68Q32) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited In (19)

• Equivalences between learning of data and probability distributions, and their applications
• Trees and learning
• Aspects of complexity of probabilistic learning under monotonicity constraints
• Counting extensional differences in BC-learning
• Learning how to separate.
• Input-dependence in function-learning
• Learning theory in the arithmetic hierarchy. II.
• One-shot learners using negative counterexamples and nearest positive examples
• Robust learning aided by context
• Enlarging learnable classes
• Learning via queries and oracles
• Approximation methods in inductive inference
• Probabilistic inductive inference: A survey
• Robust learning with infinite additional information
• Noisy inference and oracles
• On the Amount of Nonconstructivity in Learning Recursive Functions
• Structural measures for games and process control in the branch learning model
• Learning to win process-control games watching game-masters
• On the non-existence of maximal inference degrees for language identification

This page was built for publication: On the structure of degrees of inferability.

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