Papers
Topics
Authors
Recent
2000 character limit reached

Non-computability of human intelligence (1810.06985v8)

Published 12 Oct 2018 in cs.AI, cs.LO, and physics.hist-ph

Abstract: We revisit the question (most famously) initiated by Turing: can human intelligence be completely modeled by a Turing machine? We show that the answer is \emph{no}, assuming a certain weak soundness hypothesis. More specifically we show that at least some meaningful thought processes of the brain cannot be Turing computable. In particular some physical processes are not Turing computable, which is not entirely expected. There are some similarities of our argument with the well known Lucas-Penrose argument, but we work purely on the level of Turing machines, and do not use G\"odel's incompleteness theorem or any direct analogue. Instead we construct directly and use a weak analogue of a G\"odel statement for a certain system which involves our human, this allows us to side-step some (possible) meta-logical issues with their argument.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.