Boolean function
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
Also named here as exclusive-or — the same set of essays touches all of them, so they are one junction rather than several.
A plane through the cube
Some truth functions are weighted votes: give each letter a weight, add the weights of the true letters, and say yes when the total passes a threshold. On the cube of assignments, such a function is a plane cutting the true corners from the false. Majority is one. Exclusive-or is not, and never can be — and of the 65,536 functions of four letters, only 1,882 are. The ones that are are exactly what a single artificial neuron can compute.
Half the cube and √n neighbours
Choose more than half the corners of an n-dimensional cube, any way at all, and some chosen corner has at least √n chosen neighbours. That statement about a cube settled a thirty-year question about how sensitive a truth function must be to its inputs, and its proof is a matrix of plus and minus ones whose square is n times the identity. A search over every choice for the 4-cube finds the bound exactly: nine corners, and some corner always has two chosen neighbours.
Named alongside it
The objects these essays reach for when they reach for this one.
Exclusive-orExhaustive searchHypercubeEigenvalueMajority ruleParitySensitivityThreshold functionTruth table