PhilSci Archive

The Identity of Persons and Turing Machines

Eriksson, Jesper (2021) The Identity of Persons and Turing Machines. UNSPECIFIED.

[img]
Preview
Text
je_piai_8.1.pdf

Download (244kB) | Preview

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.


Export/Citation: EndNote | BibTeX | Dublin Core | ASCII/Text Citation (Chicago) | HTML Citation | OpenURL
Social Networking:
Share |

Item Type: Other
Creators:
CreatorsEmailORCID
Eriksson, Jesperjeserikson@gmail.com
Keywords: Turing computability, personal identity, information theory, chaos, dynamical systems, artificial intelligence
Subjects: Specific Sciences > Artificial Intelligence
Depositing User: Mr. Jesper Eriksson
Date Deposited: 19 Jul 2021 17:09
Last Modified: 19 Jul 2021 17:09
Item ID: 19342
Subjects: Specific Sciences > Artificial Intelligence
Date: 30 June 2021
URI: http://philsci-archive.pitt.edu/id/eprint/19342

Monthly Views for the past 3 years

Monthly Downloads for the past 3 years

Plum Analytics

Actions (login required)

View Item View Item