linear separability

[Yann le Cun]

> Does anyone know a test that could decide if a given subset of the vertex of 
> a binary hypercube is linearly separable from the rest of the set.
> ... (perceptrons already do)

Perceptrons tell you if two sets are LS, they don't tell you anything
if they are not LS: they just keep ocsillating.

The Ho-Kashyap procedure (IEEE Trans. Elec. Comp. EC14 october 1965) tells you
if two sets are linearly separable, and gives you a solution if they are.  It
is described in the book by Duda and Hart "pattern classification and scene
analysis" Wiley and Son, (1973).

 - Yann Le Cun, 
   Bell Labs Holmdel.