Hi, I have something not clear about issue of Godel's incompleteness theorem and their argument.
I have the following sentence from book titled, "Quantum Computing since Democritus" by Scott Aaronson, chapter 11, p.151. He writes,
[But let's start by summarizing, in a few sentences, the Godel argument itself for why human thought can't be algorithmic. How about this: The first incompleteness theorem tells us that no computer, working within a fixed formal system F such as Zermelo-Fraenkel set theory, can prove the sentence: G(F) = "This sentence cannot be proved in F" But we humans can just…