A comment about “Mathematical undecidability and quantum randomness” by Tomasz Paterek et al.
This is a short note pointing out that the recent paper on“Mathematical undecidability and quantum randomness” by Tomasz Paterek et al. is no black magic, and that the authors are well aware of it. Unfortunately the paper appeared on Slashdot and has since generated an infinite amount of quasi-mathematical discussions.
The paper shows very nicely how to encode provability in a propositional theory into a question about quantum mechanics. It is a cool paper. The authors mention several examples of undecidability, among others also Gödel’s result about undecidability of statements in Peano arithmetic. Judging from the garbage that is being generated on the internet, many readers of the paper are jumping to the conclusion that their encoding also applies to axiomatic systems to which Gödel’s result applies. But this is not so, and the authors state it clearly in the 4th paragraph on page 1:
“In this paper, we will consider mathematical undecidability in certain axiomatic systems which can be completed and which therefore are not subject to Gödel’s incompleteness theorem.”
Ok, did everyone get that? They can only handle finite theories expressed in the propositional calculus. They did not solve an undecidable problem, and they know it.