Pointwise Universality of the Normal Form
The problems posed here arise in the context of combinational complexity of Boolean functions whose truth tables cannot be concisely specified . This class of functions arises in the study of computation and decision-making based on natural data, such as the case of pattern recognition in uncontrolled environments. The main feature of these functions is the lack of a structure that would allow an efficient systematic implementation. This leaves us with a large number of essentially unrelated cases to account for, which puts a lower bound on the complexity of these functions. However, an exhaustive solution is not necessary either, since the essential dimensionality of the data is typically far less than the actual dimensionality.
Unable to display preview. Download preview PDF.