Computational Complexity's Fundamental Lower Bounds and Hierarchy Theorems — E8 Intelligence Research

FINDING: Computational complexity theory establishes fundamental lower bounds on algorithmic resource consumption, defining hard limits on what can be computed efficiently — the "complexity zoo" catalogs hundreds of distinct complexity classes with precise inclusion/exclusion relationships. MATH: Key structures: (1) Time hierarchy: DTIME(f(n)) ⊊ DTIME(g(n)) when f(n)·log f(n) = o(g(n)); (2) Space hierarchy: DSPACE(f(n)) ⊊ DSPACE(g(n)) when f(n) = o(g(n)); (3) P ⊆ NP ⊆ PSPACE ⊆ EXPTIME, with P ⊊ EXPTIME proven; (4) BPP ⊆ Σ₂ᵖ ∩ Π₂ᵖ; (5) Circuit lower bounds: PARITY ∉ AC⁰ (Furst–Saxe–Sipser, Ajtai); (6) Time-space tradeoffs: SAT requires either time T or space S with T·S ≥ n^{1.8} (recent bounds). Diagonalization yields strict separations; relativization barriers (Baker–Gill–Solovay) show P vs NP cannot be resolved by relativizing techniques alone. CONNECTION: Complexity class inclusion hierarchies exhibit partial-order lattice structure — a poset with meet (intersection) and join (union) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com