One of the most complex diagrams in NKS shows evidence that satisfiability is equivalent to non-deterministic Turing machines, which Wolfram describes as 'probably a bit of an extreme overkill type self-explanatory diagram', suggesting that the principle of self-explanatory diagrams could sometimes become over-elaborate.
factualpending
Speaker
Stephen WolframEvidence Quote
“this was probably one of the most complicated diagrams this is showing the sort of giving evidence that um satisfiability is equivalent to non-deterministic turing machines that's probably this is probably a bit of an extreme overkill type self-explanatory diagram”
Source
What We've Learned from NKS 20 Years Later: The Making and Current State of NKS [Part 1]— WolframCreated: 8/10/2026, 11:07:38 PM
Your notes
Loading notes...