Extremes in the degrees of inferability
DOI10.1016/0168-0072(94)90035-3zbMATH Open0813.03026OpenAlexW2064496697MaRDI QIDQ1319507FDOQ1319507
Stuart A. Kurtz, Lance Fortnow, Robert M. Solovay, Sanjay Jain, Mark Pleszkovich, Martin Kummer, Efim Kinber, William Gasarch, Theodore A. Slaman, Frank Stephan
Publication date: 3 May 1994
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(94)90035-3
Learning and adaptive systems in artificial intelligence (68T05) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Queries and concept learning
- Toward a mathematical theory of inductive inference
- Language identification in the limit
- A theory of the learnable
- The Power of Pluralism for Automatic Program Synthesis
- Inductive inference and unsolvability
- Comparison of identification criteria for machine inductive inference
- Degrees in Which the Recursive Sets are Uniformly Recursive
- Terse, superterse, and verbose sets
- A proof of Beigel's cardinality conjecture
- Effective Search Problems
- On the non-existence of maximal inference degrees for language identification
- Probability and plurality for aggregations of learning machines
- Trade-off among parameters affecting inductive inference
Cited In (23)
- The complexity of universal text-learners.
- Noisy inference and oracles
- Equivalences between learning of data and probability distributions, and their applications
- Learning languages from positive data and a finite number of queries
- Aspects of complexity of probabilistic learning under monotonicity constraints
- Index sets and universal numberings
- Learning languages from positive data and negative counterexamples
- On the learnability of vector spaces
- Input-dependence in function-learning
- One-shot learners using negative counterexamples and nearest positive examples
- Robust learning aided by context
- Learning recursive functions from approximations
- Enlarging learnable classes
- Learning via queries and oracles
- Approximation methods in inductive inference
- Probabilistic inductive inference: A survey
- Index Sets and Universal Numberings
- Infima of d.r.e. degrees
- Robust learning with infinite additional information
- The complexity of universal text-learners
- Noisy inference and oracles
- Probabilistic language learning under monotonicity constraints
- Structural measures for games and process control in the branch learning model
This page was built for publication: Extremes in the degrees of inferability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1319507)
