Extremes in the degrees of inferability

41Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

Most theories of learning consider inferring a function f from either (1) observations about f or, (2) questions about f. We consider a scenario whereby the learner observes f and asks queries to some set A. If I is a notion of learning then I[A] is the set of concept classes I-learnable by an inductive inference machine with oracle A. A and B are I-equivalent if I[A] = I[B]. The equivalence classes induced are the degrees of inferability. We prove several results about when these degrees are trivial, and when the degrees are omniscient (i.e., the set of recursive function is learnable). © 1994.

Cite

CITATION STYLE

APA

Fortnow, L., Gasarch, W., Jain, S., Kinber, E., Kummer, M., Kurtz, S., … Stephan, F. (1994). Extremes in the degrees of inferability. Annals of Pure and Applied Logic, 66(3), 231–276. https://doi.org/10.1016/0168-0072(94)90035-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free