Shannon started the information theory in 1948 by introducing the entropy that is measure for complexity in mathematical theory of communications [ 12].
The computational time complexity is an important topic in the theory of evolutionary algorithms (EAs).
This is yet another open problem in the theory of computational complexity.
Valiant made key contributions to the theory of computational complexity.
In fact, there is no credible scientific challenge to the theory of evolution as an explanation for the complexity and diversity of life on earth.
The biologist, Randy Olson, accepts that there is no credible scientific challenge to the theory of evolution as an explanation for the diversity and complexity of life on earth.
He was a Christian until halfway through his teenage years, at which point he concluded that the theory of evolution was a better explanation for life's complexity, and ceased believing in a god.
The notions of universality and completeness are central in the theories of computation and computational complexity.
In 1971 Cook published "The Complexity of Theorem Proving Procedures," a seminal paper that laid the foundations for the theory of NP-complete problems problems for which no efficient solution algorithm is known.
But the key results in the complexity theory of PDL come from Fischer and Ladner [1979] and Pratt [1980a].
In addition, Bombieri's interests included quasi-crystal tilings, meromorphic maps, the theory of univalent functions, the theory of partial differential equations, algebraic geometry, minimal surfaces, combinatorics, and complexity theory.
