Turing and Free Will: A New Take on an Old Debate

In Alisa Bokulich & Juliet Floyd (eds.), Philosophical Explorations of the Legacy of Alan Turing. Springer Verlag. pp. 305-321 (2017)
  Copy   BIBTEX

Abstract

In 1948 Turing claimed that the concept of intelligence is an “emotional concept”. An emotional concept is a response-dependent concept and Turing’s remarks in his 1948 and 1952 papers suggest a response-dependence approach to the concept of intelligence. On this view, whether or not an object is intelligent is determined, as Turing said, “as much by our own state of mind and training as by the properties of the object”. His discussion of free will suggests a similar approach. Turing said, for example, that if a machine’s program “results in its doing something interesting which we had not anticipated I should be inclined to say that the machine had originated something”. This points to a new form of free will compatibilism, which I call response-dependence compatibilism and explore here.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Deviant encodings and Turing’s analysis of computability.B. Jack Copeland & Diane Proudfoot - 2010 - Studies in History and Philosophy of Science Part A 41 (3):247-252.
Turing's golden: How well Turing's work stands today.Justin Leiber - 2006 - Philosophical Psychology 19 (1):13-46.
A Reducibility Related To Being Hyperimmune-free.Frank Stephan & Liang Yu - 2014 - Annals of Pure and Applied Logic 165 (7-8):1291-1300.
The Turing test.B. Jack Copeland - 2000 - Minds and Machines 10 (4):519-539.
What Turing did after he invented the universal Turing machine.Diane Proudfoot & Jack Copeland - 2000 - Journal of Logic, Language and Information 9:491-509.
Turing cones and set theory of the reals.Benedikt Löwe - 2001 - Archive for Mathematical Logic 40 (8):651-664.
On Turing degrees of points in computable topology.Iraj Kalantari & Larry Welch - 2008 - Mathematical Logic Quarterly 54 (5):470-482.

Analytics

Added to PP
2020-02-07

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Diane Proudfoot
University of Canterbury

References found in this work

No references found.

Add more references