| http://www.w3.org/ns/prov#value | - The one new, true thing is a proof that the elementary CA rule 110 can support universal, Turing-complete computation. (One of Wolfram's earlier books states that such a thing is obviously impossible.) This however was shown not by Wolfram but by Matthew Cook (this is the ``technical content and proofs'' for which Wolfram acknowledges Cook, in six point type, in his frontmatter).
|
