Back to Search Start Over

The Identity of Persons and Turing Machines

Authors :
Eriksson, Jesper
Eriksson, Jesper
Publication Year :
2021

Abstract

A fundamental question in artificial intelligence research is whether a person is a computable entity, i.e. whether the time dependent relation which connects various states of a person (personal identity) is in principle Turing computable. I reject this idea by three steps: (i), detailing personal identity as information transmission; (ii), analysing personal identity as a branching relation; (iii), characterising this branching relation as a chaotic dynamical system that is shown undecidable. I therefore maintain that if the identity of persons is branching, then it cannot be decidedly computed by deductive Turing machines.

Details

Database :
OAIster
Notes :
text, English
Publication Type :
Electronic Resource
Accession number :
edsoai.on1273710042
Document Type :
Electronic Resource