- This page was last edited on 7 July 2018, at 03:05.
- Content is available under Attribution-NonCommercial-ShareAlike 3.0 Unported unless otherwise noted.
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).
