You should call it entropy, for two reasons. In the first place your uncertainty function has been used in statistical mechanics under that name, so it already has a name. In the second place, and more important, no one really knows what entropy really is, so in a debate you will always have the advantage.

The classical definitions of free competition all involve further postulates besides the greatness of that number. E.g., it is clear that if certain great groups of participants will — for any reason whatsoever — act together, then the great number of participants may not become effective; the decisive exchanges may take place directly between large “coalitions,”1 few in number, and not between individuals, many in number, acting independently. Our subsequent discussion of “games of strategy” will show that the role and size of “coalitions” is decisive throughout the entire subject.

Any artificial automaton that has been constructed for human use, and specifically for the control of complicated processes, normally possesses a purely logical part and an arithmetical part, i.e. a part in which arithmetical processes play no role, and one in which they are of importance.

The McCulloch-Pitts result . . . proves that anything that can be exhaustively and unambiguously described, anything that can be completely and unambiguously put into words, is ipso facto realizable by a suitable finite neural network.