Non-computability of human intelligence

10/12/2018
by   Yasha Savelyev, et al.
0

We revisit the question (most famously) initiated by Turing:Can human intelligence be completely modelled by a Turing machine? To give away the ending we show here that the answer is no. More specifically we show that at least some thought processes of the brain cannot be Turing computable. In particular some physical processes are not Turing computable, which is not entirely expected. The main difference of our argument with the well known Lucas-Penrose argument is that we do not use Gödel's incompleteness theorem, (although our argument seems related to Gödel's) and we do not need to assume fundamental consistency of human reasoning powers, (which is controversial) we also side-step some meta-logical issues with their argument, which have also been controversial. The argument is via a thought experiment and at least partly physical, but no serious physical assumptions are made. Furthermore the argument can be reformed as an actual (likely future) experiment.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/21/2020

Turing analogues of Gödel statements and computability of intelligence

We show that there is a mathematical obstruction to complete Turing comp...
research
05/07/2023

Human or Machine: Reflections on Turing-Inspired Testing for the Everyday

Turing's 1950 paper introduced the famed "imitation game", a test origin...
research
01/15/2012

The non-algorithmic side of the mind

The existence of a non-algorithmic side of the mind, conjectured by Penr...
research
03/30/2006

If a tree casts a shadow is it telling the time?

Physical processes are computations only when we use them to externalize...
research
08/29/2022

Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)

Semi-unification is the combination of first-order unification and first...
research
05/28/2020

No Substitute for Functionalism – A Reply to 'Falsification Consciousness'

In their paper 'Falsification and Consciousness' [1], Kleiner and Hoel i...
research
08/09/2022

Incompleteness for stably computable formal systems

We prove, for stably computably enumerable formal systems, direct analog...

Please sign up or login with your details

Forgot password? Click here to reset