korrents

korrents · piece

P vs. NP and the Difficulty of Computation: A Ruliological Approach

Stephen Wolfram · 30 Jan 2026

Read the piece on writings.stephenwolfram.com ↗

1 korrent from this piece ↓

Stephen Wolfram did not write this page.

Every claim below was made in this piece, quoted word for word and numbered in the order the piece makes them, so you can read it there rather than take our word for it. The sentence above each quote is our reading of the claim, not their wording. Each quote was checked against a stored copy of the page at build time; where the two differ, the quote is the fact.

  1. But what I discovered in the early 1980s is that this is absolutely not the case-and that in fact it's very common for programs even small enough to be easily enumerated to show extremely rich and complex behavior.

Keep reading

The other pieces are the ones whose claims are worded most like this one's. That measures language, not agreement: they may argue the opposite.