Boolean Functions and Computation Models

The foundations of computational complexity theory go back to Alan Thring in the 1930s who was concerned with the existence of automatic procedures deciding the validity of mathematical statements. The first example of such a problem was the undecidability of the Halting Problem which is essentially the question of debugging a computer program: Will a given program eventu­ ally halt? Computational complexity today addresses the quantitative aspects of the solutions obtained: Is the problem to be