P vs. NP and the Difficulty of Computation: A ruliological approach
by tzury on 1/30/2026, 9:17:21 PM
Comments
by: soganess
Can someone tell me what I am missing here?<p>This seems to suffer from a finite-size effect. Wolfram's machines have a tiny state space (s ≤ 4, k ≤ 3). For some class of NP problems, this will be insufficient to encode complex algorithms and is low dimensional enough that it is unlikely to be able to encode hard instances ("worst case") of the problem class. The solution space simply cannot support them.<p>In this regime, hard problem classes only have easy solutions, think random k-SAT below the satisfiability threshold, where algorithms like FIX (Coja-Oghlan) approximate the decision problem in polynomial time. In random k-SAT, the "hardness" cannot emerge away from the phase transition and by analogy (watch my hand wave in the wind so free) I can imagine that they would not exist at small scales. Almost like the opposite of the overlap gap property.<p>Wolfram's implicit counter-claim seems to be that the density of irreducibility among small machines approximates the density in the infinite limit (...or something? Via his "Principle of Computational Equivalence"), but I'm not following that argument. I am sure someone has brought this up to him! I just don't understand his response. Is there some way of characterizing / capturing the complexity floor of a given problem (For an NP-hard Problem P the reduced space needs to be at least as big as S to, WHP, describe a few hard instances)?
1/31/2026, 2:55:35 AM
by: jojomodding
Someone should tell Stephen Wolfram about the bbchallenge wiki (bb for busy beaver): <a href="https://wiki.bbchallenge.org/wiki/Main_Page" rel="nofollow">https://wiki.bbchallenge.org/wiki/Main_Page</a>
1/30/2026, 11:22:37 PM
by: kittikitti
I find that the "ruliological approach" is very similar to feasible mathematics by Jiatu Li (<a href="https://eccc.weizmann.ac.il/report/2025/086/" rel="nofollow">https://eccc.weizmann.ac.il/report/2025/086/</a>). In the last section before the Personal Notes, "In effect, we’re seeing that theoretical computer science can be done not only “purely theoretically”—say with methods from traditional mathematics—but also “empirically”, finding results and developing intuition by doing explicit computational experiments and enumerations." Where regular mathematics is "purely theoretical" and "empirically" is what Jiatu Li also describes in his paper sometimes referred to reverse mathematics like from Quanta magazine.<p>I appreciated the great explanation of space complexity and it eludicated why some scientific authors don't include it in their analysis of algorithms. However, Wolfram found that "by successively investigating both larger inputs and longer runtimes, one can develop reasonable confidence that—at least most of the time—one is correctly identifying both cases that lead to halting, and ones that do not." There are exceptions like Machine 600720 that have exceptionally long runtimes but I gain a much better understanding about an algorithm if I'm provided the space complexity. It's still an open question in pure theory but it could be understood from empirical results.
1/31/2026, 4:13:19 AM
by: abetusk
To me, this reads like a profusion of empirical experiments without any cohesive direction or desire towards deeper understanding.
1/31/2026, 12:17:07 AM
by: CaptainNegative
This is so tangentially related to the P vs NP problem that the title is basically pure clickbait. Remove every sentence relating to polynomial anything and the information content of the write-up doesn't change at all.
1/31/2026, 12:07:14 AM
by:
1/30/2026, 11:56:49 PM
by: graemefawcett
[flagged]
1/31/2026, 1:04:31 AM
by: Nir-Complex
[dead]
1/31/2026, 12:43:03 AM
by: Nir-Complex
[dead]
1/31/2026, 12:01:04 AM
by: MohskiBroskiAI
[flagged]
1/30/2026, 9:23:46 PM
by: gerdesj
This is AI slop, sadly. Here's a sentence that very few humans might scribe:<p>"But what if one were to look at the question empirically, say in effect just by enumerating possible programs and explicitly seeing how fast they are, etc.?"<p>It is absolutely rammed with m dashes, which is not conclusive. For me, a bit of a clanger is that the writer might have decided to instruct the beastie to go fast and loose with grammar "norms". So, we have loads and loads of sentences starting off with a conjunction (and, but).<p>It just gets worse. The article is huge - it's over 17,000 words. I've skimmed it and its awful.<p>Please don't do this.
1/31/2026, 2:48:22 AM