scientific article
From MaRDI portal
Publication:4013540
zbMath0747.68043MaRDI QIDQ4013540
Mark B. Pleszkoch, William I. Gasarch
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
The complexity of universal text-learners ⋮ Learning by switching type of information. ⋮ Learning languages from positive data and negative counterexamples ⋮ On the non-existence of maximal inference degrees for language identification ⋮ Learning languages from positive data and a finite number of queries ⋮ Robust learning with infinite additional information ⋮ Vacillatory and BC learning on noisy data ⋮ Equivalences between learning of data and probability distributions, and their applications ⋮ Learning algebraic structures from text ⋮ Aspects of complexity of probabilistic learning under monotonicity constraints ⋮ Learning via queries and oracles ⋮ The complexity of universal text-learners. ⋮ Extremes in the degrees of inferability
This page was built for publication:
