Survey propagation: an algorithm for satisfiability — mentioned by abetusk

Sat, 31 Jan 2026 03:48:08 GMT

I think you have it wrong. Wolfram's claim is that for a wide array of small (s,k) (including s <= 4, k <= 3), there's complex behavior and a profusion of (provably?) Turing machine equivalent (TME) machines. At the end of the article, Wolfram talks about awarding a prize in 2007 for a proof that (s=2,k=3) was TME. The `s` stands for states and `k` for colors, without talking at all about tape length. One way to say "principle of computational equivalence" is that "if it looks complex, it probably is". That is, TME is the norm, rather than the exception. If true, this probably means that you…

Paper and discussion history. A mention is not an endorsement.

Survey propagation: an algorithm for satisfiability · HackerPapers discussions

Survey propagation: an algorithm for satisfiability — mentioned by abetusk