NP-Completeness via Nested-Ontologies(NOS): Siegel FUZZYICS in Aristotle “Square-of-Opposition”(SoO) in Aristotle Hierarchy-of-Thinking(HoT): P=/=NP Trivial Proof via Menger/Polya Dimension-Theory: Algorithmic-“Complexity”(AC)=Utter-Simplicity(US)

NP-completeness[Poundstone[Labyrinths of Reason(88)-ch.9/p.162]; Korte/Vygen[Comb.Optim.(02)-ch.15/p.327]] realization is via NOS: Siegel[Symp./Fractals,MRS Fall Mtg.,Boston(89)-6 pprs(read #2 pre #1);Symp./Transport within Geometric-Constraints,ibid(90)] FUZZYICS/(SPD/M) embedded within Aristotle/Copi[Symbolic-Logic(61)]/Horn [Linguistics/Yale]/Parsons [Philo./UCLA/Stanford Encycl./Philo.]/… “Square-of-Opposition”(SoO) in Aristotle/Altshuler (TRIZ)/Siegel “Hierarchy-of-Thinking”(HoT): AC = utter-simplicity in Siegel P=/=NP trivial proof via Menger[Dimensiontheorie(29)]/Polya[How to Solve It(45/73)-table] dimension-theory(DT) dimensionalty-fluctuations(DFS) table and Sipser[Intro./Thy.Computations(13)-fig.#1.15!] graphic. P “=” NP aka deterministic-polynomial P “=” NP aka deterministic-polynomial “=” non-deterministic polynomial aka DP “=” NP. dim(D) “=” dim(M) because P cancels: deterministic D is serial aka dim(D)=1 VS. dim (M) = 2+E(if probabilistic) aka non-deterministic = planar forking-triangles simplex: 1<2+E(if probabilistic aka 1=/= 2+E. Ergo P=/=NP! Utter-Simplicity! (analogy to Siegel(64)[<<