Classification Using Information

@inproceedings{Gasarch1994ClassificationUI,
  title={Classification Using Information},
  author={William I. Gasarch and Mark G. Pleszkoch and Mahendran Velauthapillai},
  booktitle={AII/ALT},
  year={1994}
}
Let A be a set of functions. A classifier for A is a way of telling, given a function f , if f is in A. We will define this notion formally. We will then modify our definition in three ways: (1) Allow the classifier to ask questions to an oracle A (thus increasing the classifiers computational power). (2) Allow the classifier to ask questions about f (thus increasing the classifiers information access). (3) Restrict the number of times the classifier can change its mind (thus decreasing the… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 12 REFERENCES

Some examples of Borel sets

  • R. Engelking, W. Holsztyński, R. Sikorski
  • Colloquium Mathematicum, 15:271–274
  • 1966
Highly Influential
4 Excerpts

The power of pluralism for automatic program synthesis

  • Carl Smith
  • Journal of the ACM,
  • 1982
Highly Influential
4 Excerpts

Learning via queries, teams, and anomalies

  • William Gasarch, Efim Kinber, Mark Pleszkoch, Carl Smith, Thomas Zeugmann
  • Fundamenta Informaticae,
  • 1995

Classical Recursion Theory

  • Daniel Osherson, Micheal Stob, Scott Weinstein.
  • The Logic of Reliable Inquiry
  • 1989

Similar Papers

Loading similar papers…