OFFSET
0,3
COMMENTS
The corresponding systems of linear inequalities are not solvable: linearly non-separable truth or switching functions. Truth functions which ar "non-neurons" and are realizable only as two levels threshold gate networks.
LINKS
Wang Lan, Table of n, a(n) for n = 0..9
FORMULA
a(n) = 2^(2^n) - A000609(n).
EXAMPLE
n=2: out of the 16 B^2 -> B^1 truth functions, 14 are linearly separable; the 2 exceptions are XOR and its negation: f(x,y) = !xz + x!y and !f(x,y) = xy + !x!y. So a(2)=2. With increasing n, the chance that a switching function belongs to this sequence tends to 1.
CROSSREFS
KEYWORD
nonn
AUTHOR
Labos Elemer, Oct 01 2001
STATUS
approved