5 ms·
>The paper's called Why Computers Will Never Read (or Write) Literature: A Logical Proof and a Narrative.. That reminds me of a more serious approach of that p
by benibela 6y ago
>The paper's called Why Computers Will Never Read (or Write) Literature: A Logical Proof and a Narrative..
That reminds me of a more serious approach of that proof.
Roger Penrose's books, The Emperor's New Mind and the two sequels
The Penrose–Lucas argument based on Gödel's incompleteness theorem. From the theorem we know any mathematical system has sentences that the system itself cannot prove.
So computer algorithms, based on mathematical systems, cannot prove them either. (just like the Halting problem)
But humans can prove them like Gödel did.
Thus human intelligence is noncomputable and inherently superior to AIs.
That would also be true for novels, since novels can contain character talking about such proves.
But, Penrose takes it to the next step. The laws of physics are also a mathematical system and fully simulatable by a computer. But since the computer cannot simulate human intelligence as proved before, this proves that human intelligence is not described by physical laws.
That raises the question, if consciouness is not described by physical laws, ? Essentially it would appear as a random influence to physics (even though it is not actually random, just noncomputable). Now there is a completely random process in physics: quantum wave function collapse. Then he goes on, that consciouness comes from features embedded at the Planck scale in the spacetime geometry.
>4. Causal reasoning cannot be performed by machine-learning algorithms because those algorithms run on the CPU's Arithmetic Logic Unit, which is designed to run symbolic logic, and symbolic logic can only process correlation.
And I just wrote my PhD thesis about causal reasoning algorithms :/
- webmaven 6y ago> And I just wrote my PhD thesis about causal reasoning algorithms :/ Sounds interesting. Link?
- benibela 6y agoHere: https://benibela.de/bin/others/phd-thesis.pdf https://benibela.de/bin/others/phd-thesis.pdf
- tsimionescu 6y ago> The Penrose–Lucas argument based on Gödel's incompleteness theorem. From the theorem we know any mathematical system has sentences that the system itself cannot prove. So computer algorithms, based on mathematical systems, cannot prove them either. (just like the Halting problem) But humans can prove them like Gödel did. Thus human intelligence is noncomputable and inherently superior to AIs. Godel's incompleteness theorems apply to math itself, not to computation. Those observations are not provable but incomputable, they are not provable in the formal system at all. So, humans can't prove them anymore than computers could. The gods themselves couldn't prove them. What I believe the argument could be is that humans still found them and have reasons to believe they are true (they have an informal proof), even if they can't be formally proven. However, the Penrose-Lacau argument is quite infamous and is generally not believed in the scientific community. The most obvious way out of Godel's incompleteness theorems conflict with human mathematicians is to simply reject the notion that human mathematicians have proven these things in any sense. Godel's incompleteness theorems don't forbid incorrect but convincing proofs, and informal proofs that can't be formalized could well be just that.