Jump to content

Subclass reachability

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Yobot (talk | contribs) at 12:10, 7 January 2015 (Tagging using AWB (10703)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)

This article does not cite any sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Subclass reachability" – news · newspapers · books · scholar · JSTOR (January 2009) (Learn how and when to remove this message)

This article is an orphan, as no other articles link to it. Please introduce links to this page from related articles; try the Find link tool for suggestions. (November 2011)

This article provides insufficient context for those unfamiliar with the subject. Please help improve the article by providing more context for the reader. (February 2011) (Learn how and when to remove this message)

(Learn how and when to remove this message)

In computational learning theory in mathematics, given a class of concepts C, a subclass D is reachable if there exists a partial approximation S of some concept such that D contains exactly those concepts in C that are extensions to S (i.e., D=C|S).

This mathematics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Subclass_reachability&oldid=641401945"

Hidden categories: