On the structure of degrees of inferability.

DOI10.1006/jcss.1996.0018zbMath1152.68452OpenAlexW4213286322MaRDI QIDQ960466

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)

Related Items (19)

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

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