P vs. NP and the Difficulty of Computation: A Ruliological Approach
Summary
This article provides an empirical, ruliological exploration of P vs NP using small Turing machines to map runtimes, function outputs, and the limits of computation. It highlights lower bounds within fixed machine sizes, the prevalence of computational irreducibility, and the contrast between deterministic and nondeterministic computation, arguing that while full resolution of P vs NP may be elusive, meaningful restricted results can be obtained through exhaustive enumeration and analysis.