No New P vs NP Results: Sources Are Expository Only — E8 Intelligence Research

FINDING: No new mathematical results on P vs NP are present in these sources — all are expository/popular (Wikipedia, Lex Fridman clips, YouTube explainers); zero theorems, zero proofs, zero complexity-class separations. | MATH: P = {L : L decided by a DTM in O(n^k), k∈ℕ}; NP = {L : L verified by a DTM in poly(n) given a certificate}; P ⊆ NP (trivial); P = NP? open since Cook 1971 / Levin 1973; Millennium Prize (2000), $1M. Known barriers: relativization (Baker–Gill–Solovay 1975), natural proofs (Razborov–Rudich 1997), algebrization (Aaronson–Wigderson 2008). Best known: NP ⊆ EXP; if P=NP then PH collapses to Σ₂ᵖ (Karp–Lipton). | CONNECTION: None supported by evidence. No ratios (0.382, 0.618, 0.786, 1.618, 2.618), no base-60, no crystallographic/root-system/lattice structure appears in any cited source. Any such link would be speculation — declined. | DEPTH: 1/10 (no new result; pedagogical content only). Note: The search returned no primary literature (no arXiv, no STOC/FOCS/ECCC pa Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-03
DOI
https://doi.org/10.5281/zenodo.23909822
Primary Topic
Complexity and Algorithms in Graphs
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

No New P vs NP Results: Sources Are Expository Only — E8 Intelligence Research

Andrew Stewart Caldin
Zenodo (CERN European Organization for Nuclear Research)
Complexity and Algorithms in Graphs
preprint

No New P vs NP Results: Sources Are Expository Only — E8 Intelligence Research

Andrew Stewart Caldin
preprint en

Abstract

FINDING: No new mathematical results on P vs NP are present in these sources — all are expository/popular (Wikipedia, Lex Fridman clips, YouTube explainers); zero theorems, zero proofs, zero complexity-class separations. | MATH: P = {L : L decided by a DTM in O(n^k), k∈ℕ}; NP = {L : L verified by a DTM in poly(n) given a certificate}; P ⊆ NP (trivial); P = NP? open since Cook 1971 / Levin 1973; Millennium Prize (2000), $1M. Known barriers: relativization (Baker–Gill–Solovay 1975), natural proofs (Razborov–Rudich 1997), algebrization (Aaronson–Wigderson 2008). Best known: NP ⊆ EXP; if P=NP then PH collapses to Σ₂ᵖ (Karp–Lipton). | CONNECTION: None supported by evidence. No ratios (0.382, 0.618, 0.786, 1.618, 2.618), no base-60, no crystallographic/root-system/lattice structure appears in any cited source. Any such link would be speculation — declined. | DEPTH: 1/10 (no new result; pedagogical content only). Note: The search returned no primary literature (no arXiv, no STOC/FOCS/ECCC pa Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Zenodo (CERN European Organization for Nuclear Research)
Complexity and Algorithms in Graphs
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon