Home/Blog/Title: The O(n^{100}) Fraud: Why P vs. NP is a Physical ImpossibleOpen SourceTitle: The O(n^{100}) Fraud: Why P vs. NP is a Physical ImpossibleHacker News New2026-11-11 14:390 viewsArticle URL: https://substack.com/ Comments URL: https://news.ycombinator.com/item?id=50450353 Points: 1 # Comments: 0Source:https://substack.com/My favoritesPreviousAI Cracks a Quantum Computing BottleneckNextMonads in LeanRelated postsThe Rise of Low Precision Floating PointarXiv:2611.00301v2 Announce Type: replace-cross Abstract: Floating point computing has dominated scientific computations0arXiv cs.NAA Projection Anderson Acceleration Algorithm for Non-quasi-monotone Variational Inequalities with H\"older Continuous TermsarXiv:2610.18370v2 Announce Type: replace-cross Abstract: This paper proposes a Projection Anderson Acceleration (PAA) a0arXiv cs.NAOn bifurcations and traction forces on an obstacle in incompressible flowarXiv:2512.15424v3 Announce Type: replace-cross Abstract: A systematic numerical investigation of flow-regime transition0arXiv cs.NAGaussian mixture models in Hilbert spaces via kernel methodsarXiv:2605.05996v2 Announce Type: replace Abstract: Modern datasets across many disciplines increasingly consist of time0arXiv stat.MLElastic-WAM: Adaptive Spatiotemporal Imagination for Efficient Robot ControlarXiv:2611.14257v1 Announce Type: new Abstract: World-Action Models improve robot control by predicting future visual dy0arXiv cs.RORedirectMimic: Local Motion Content Redaction for Humanoid Whole-Body ControlarXiv:2611.14049v1 Announce Type: new Abstract: Humanoid motion interfaces should accommodate application-specific movem0arXiv cs.RO