Machine Intelligence and the Ethical Grammar of Computability

Since the publication of Alan Turing’s famous papers on “machine intelligence” over six decades ago, questions about whether complex mechanical systems can partake in intelligent cognitive processes have largely been answered under the analytical rubric of their capacity successfully to simulate symbol-mongering human behavior. While this focus on the mimetic potential of computers in response to the question “Can machines think?” has come to be accepted as one of the great bequests of Turing’s reflections on the nature of artificial intelligence, I argue in this paper that a closer look at Turing’s oeuvre reveals an especially informative tension between the pragmatic and normative insights, which enabled him in 1936 to formulate his pioneering version of the theory of mechanical computability, and his later attempt to argue for a simplistic notion of “machine intelligence” as an effectual imitation of the human mind. In fleshing out the source of this tension, I endeavor to show how the mimetic model of “thinking machines” that Turing eventually embraces is ultimately at cross-purposes with the normative-pragmatic insights by which he reached his original innovations in computability theory and combinatorial logic.

[1]  Hugh Miller,et al.  Mind and the World Order , 1931 .

[2]  A. Church Review: A. M. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem , 1937 .

[3]  Stephen Cole Kleene,et al.  Reflections on Church's thesis , 1987, Notre Dame J. Formal Log..

[4]  Nelson Goodman,et al.  The Way the World Is , 1960 .

[5]  Alan M. Turing,et al.  Systems of Logic Based on Ordinals , 2012, Alan Turing's Systems of Logic.

[6]  K. Gödel,et al.  Unpublished Philosophical Essays , 1997 .

[7]  J. Searle Austin on Locutionary and Illocutionary Acts , 1968 .

[8]  R. Rorty Consequences of pragmatism , 1982 .

[9]  K. Jaspers,et al.  The Origin and Goal of History , 1953 .

[10]  Michel Foucault,et al.  The Order of Things , 2010 .

[11]  Oron Shagrir,et al.  The Church-Turing “Thesis” as a Special Corollary of Gödel's Completeness Theorem , 2013 .

[12]  Wilfried Sieg,et al.  On mind & Turing’s machines , 2007, Natural Computing.

[13]  A. Turing On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[14]  A. M. Turing,et al.  Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.

[15]  D. Frisby,et al.  Towards a Transformation of Philosophy , 2023 .

[16]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[17]  Kurt Gödel,et al.  On Formally Undecidable Propositions of Principia Mathematica and Related Systems , 1966 .

[18]  H. Gadamer,et al.  Truth and Method , 1960 .

[19]  Stuart M. Shieber Can Digital Computers Think , 2004 .

[20]  J. Dewey,et al.  The Quest for Certainty , 1929 .

[21]  Alonzo Church,et al.  A. M. Turing. On computable numbers, with an application to the Entscheidungs problcm. Proceedings of the London Mathematical Society , 2 s. vol. 42 (1936–1937), pp. 230–265. , 1937, Journal of Symbolic Logic.

[22]  D. Hofstadter,et al.  Godel, Escher, Bach: An Eternal Golden Braid , 1979 .

[23]  Roman Murawski Recursive Functions and Metamathematics , 1999 .

[24]  Anders Martin-Löf,et al.  Collected Works I , 1994 .

[25]  S. Barry Cooper,et al.  Solvable and Unsolvable Problems , 2013 .