2009, Part III, 377-411, DOI: 10.1007/978-1-4020-6710-5_23

Laplace, Turing and the “Imitation Game” Impossible Geometry
Randomness, Determinism and Programs in Turing’s Test

Giuseppe Longo

View Related Documents

Abstract

From the physico-mathematical view point, the imitation game between man and machine, proposed by Turing in his 1950 paper for the journal “Mind”, is a game between a discreteand a continuoussystem. Turing stresses several times the Laplacian nature of his discrete-state machine, yet he tries to show the undetectability of a functional imitation, by his machine, of a system (the brain) that, in his words, is not a discrete-state machine, as it is sensitive to limit conditions. We shortly compare this tentative imitation with Turing’s mathematical modeling of morphogenesis (his 1952 paper, focusing on continuous systems, as he calls nonlinear dynamics, which are sensitive to initial conditions). On the grounds of recent knowledge about dynamical systems, we show the detectability of a Turing Machine from many dynamical processes. Turing’s hinted distinction between imitation and modeling is developed, jointly to a discussion on the repeatability of computational processes in relation to physical systems. The main references are of a physico-mathematical nature, but the analysis is purely conceptual.

Keywords  Turing Machine - classical determinism - dynamical systems - computational and dynamical hypotheses - functional analyses of cognition - iteration - Laplace

Fulltext Preview

Image of the first page of the fulltext document