| 1. | The original CNN processors can only perform linearly separable Boolean functions.
|
| 2. | Boolean function, taking on each value exactly half of the time.
|
| 3. | Circuit complexity goes back to superpolynomial circuit lower bounds for specific Boolean functions.
|
| 4. | For example, consider the Boolean function described by the following truth table.
|
| 5. | Conversely, any Boolean function with nonlinearity is bent.
|
| 6. | For a typical Boolean function, there are many different functionally equivalent transistor netlists.
|
| 7. | This research has uncovered links between correlation immune Boolean functions and error correcting codes.
|
| 8. | It's monotonically decreasing, if that can be said of a boolean function.
|
| 9. | There are sixteen Boolean functions associating the input truth values and with four-digit binary outputs.
|
| 10. | These are fundamentally consequences of the law of bivalence, which makes all such connectives merely Boolean functions.
|
