Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
From the Tannhäuser Gate to z8_GND_5296: A Day Trip on the Life-Cycle of Information Kapitel lesen Erstes Kapitel lesen

2017 | OriginalPaper | Buchkapitel

6. From Computing Machines to Learning Intelligent Machines: Chronological Development of Alan Turing’s Thought on Machines

verfasst von : Katsuhiko Sano, Mai Sugimoto

Erschienen in: Understanding Information

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The most famous academic contributions of Alan Turing are on Turing machines in 1936 and on the Turing test in 1950. While the motivations of these two works are apparently quite different, this chapter tracks Turing’s chronological development between these two contributions and points out how conceptual continuity can be found in Turing’s thought on machines.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel Memory Processing in the Nervous System
Nächstes Kapitel Finite Information Agency
Fußnoten
1
Such a formal system should be found in a standard textbook of mathematical logic, e.g., see Enderton 2001, Section 2.​4. Turing (1936) used a formal system “K” from Hilbert and Ackermann (1928) for the first-order logic.
 
2
The reader may wonder how Max Newman knew the problem. Grattan-Guinness wrote that Newman sent a letter to Bertrand Russell from Italy in September 1928 soon after attending the conference (see Grattan-Guinness 2012, p.19). So Newman might know at least the problem of “completeness” of a formal system of the first-order logic, which was solved by Gödel in 1930, at the International Congress of Mathematicians at Bologna in 1928, because David Hilbert explained the problem in his talk there.
 
3
We note that Turing himself did not use the term “program” in Turing (1936). For this point, the reader is referred also to Copeland 2004a, pp.30–2.
 
4
This example is not exactly the same as that which is given in Turing (1936). We note that state transition graphs were not used in Turing (1936).
 
5
Unfortunately, there is a flaw in Turing’s definition of computable numbers in the sense that, even if x and y are computable real numbers, x + y may not be computable (for more detail, the reader is referred to Gherardi 2011, pp.404–6). Therefore, Turing revised his definition of computable number in Turing (1937).
 
6
Turing’s implementation of the idea of the universal Turing machine is so large-scale that it cannot avoid containing some “bugs” or programming errors, though Davies (2004) describes how to fix these errors.
 
7
Martin Davis, who is a student of Alonzo Church, thinks it likely that he first used the term “halting problem” in a series of lectures at the University of Illinois in 1952 (cf. Copeland 2004a, p.40). After the publication of the textbook by Davis (1982) on computability, it seems that the term “halting problem” has been widely known (cf. Petzold 2008). The book by Davis (1982) is a well-written introduction to the computability in terms of Turing machines.
 
8
We use “she” or “her” as a gender-neutral singular pronoun in this chapter.
 
9
This paper was never published in Turing’s lifetime. We could access the digitally scanned copy via The Turing Digital Archive (http://​www.​turingarchive.​org/​). Reprints are published in Carpenter and Doran (1977) and Copeland (2004b), and they provide different revisions at some points. In this chapter, we use page numbers of Copeland (2004b).
 
10
We could access the digitally scanned copy of the original typescript via The Turing Digital Archive (http://​www.​turingarchive.​org/​). Reprints are published in Robinson and Evans (1968) and Copeland (2004b). In this chapter, we use page numbers of Copeland (2004b).
 
11
This was not the first time that Turing presented this kind of game. In the last part of Turing (1948), a prototype of the Turing test is presented, as follows:
Now get three men as subjects for the experiment A, B, C. A and C are to be rather poor chess players, B is the operator who works the paper machine. […] Two rooms are used with some arrangement for communicating moves, and a game is played between C and either A or the paper machine. C may find it quite difficult to tell which he is playing. (Turing 1948, p.431)
 
12
Note that Turing believed a computing machine which can play the imitation game well is obtained by programming, not by tinkering hardware. Turing said “[o]ur problem then is to find out how to programme these machines to play the game” (cf. Turing 1950a, p.455).
 
13
We note that in a script of BBC radio program “Can Automatic Calculating Machines Be Said to Think,” Turing said it would be “at least 100 years” for a machine to play the imitation game sufficiently. See Newman et al. (1952) in Copeland (2004b, p.495).
 
Literatur
Anderson D (2013) Max Newman: forgotten man of early British computing. Commun ACM 56(5):29–31CrossRef
Boolos GS, Burgess JP, Jeffery RC (2007) Computability and logic. Cambridge University Press, CambridgeCrossRefMATH
Copeland BJ (2004a) Computable numbers: a guide. In: Copeland BJ (ed) The essential Turing. Oxford University Press, Oxford, pp 5–57
Copeland BJ (2004b) The essential Turing: seminal writings in computing, logic, philosophy, artificial intelligence, and artificial life plus the secrets of Enigma. Oxford University Press, Oxford/New YorkMATH
Davies DW (2004) Corrections to Turing’s universal computing machine. In: Copeland BJ (ed) The essential Turing: seminal writings in computing, logic, philosophy, artificial intelligence, and artificial life plus the secrets of enigma, chapter 2.4 Oxford University Press, Oxford/New York, pp 103–124
Davis M (1982) Computability and unsolvability. Dover, New YorkMATH
Detlefsen M, MacCarty DC, Bacon JB (1999) LOGIC from A to Z. Routledge, London/New York
Enderton EB (2001) A mathematical introduction to logic, 2nd edn. Academic Press, San DiegoMATH
Gandy R (1995) The confluence of ideas in 1936. In: Herken R (ed) The universal Turing machine. Springer, New York
Gödel K (1930) Die Vollständigkeit der Axiome des logischen Functionenkalküls. Monatshefte für Mathematik und Physik. 37:349–360MathSciNetCrossRefMATH
Gödel K (1931) Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme, I. Monatshefte für Mathematik und Physik. 38:173–98CrossRefMATH
Grattan-Guinness I (2012) Logic, topology and physics: points of contact between Bertrand Russell and Max Newman. J Bertrand Russell Stud 32:5–29
Hilbert D, Ackermann W (1928) Grundzüge der theoretischen Logik. Springer, BerlinMATH
Hodges A (1992) Alan Turing: the enigma. Vintage Books, LondonMATH
Newman MHA (1955) Alan Mathison Turing. Biogr Mem Fellows R Soc 1:253–263CrossRef
Newman MHA, Turing AM, Jefferson G, Braithwaite RB (1952) Can automatic calculating machines be said to think? Radio interview, recorded 10 Jan 1952 and broadcast 14 and 23 Jan 1952. Turing Archives reference number B.6.
Petzold C (2008) The Annoteated Turing. Wiley, Indianapolis
Robinson ADJ, Evans C (1968) Cybernetics: key papers. Butterworths, London
Shieber S (2004) The Turing test: verbal behavior as the hallmark of intelligence. MIT Press, CambridgeMATH
Sieg W (1993) Mechanical procedures and mathematical experience. In: George A (ed) Mathematics and mind, chapter 4. Oxford University Press, New York, pp. 71–117
Teuscher C (2001) Turing’s connectionism: an investigation of neural network architectures. Springer, LondonMATH
Turing AM (1936) On computable numbers with an application to the Entscheidungsproblem. Proc Lond Math Soc 42:230–265. Reprinted In: Copeland BJ (ed) The essential Turing: seminal writings in computing, logic, philosophy, artificial intelligence, and artificial life plus the secrets of Enigma. Oxford University Press, Oxford/New York (2004)
Turing AM (1937) On computable numbers, with an application to the Entscheidungsproblem. A correction. Proc Lond Math Soc 43:544–546. Reprinted In: Copeland BJ (ed) The essential Turing: seminal writings in computing, logic, philosophy, artificial intelligence, and artificial life plus the secrets of Enigma. Oxford University Press, Oxford/New York (2004)
Turing AM (1939) Systems of logic defined by ordinals. Proc Lond Math Soc 45:161–228CrossRefMATH
Turing AM (1946) Proposal for development in the mathematics division of an automatic computing engine (ACE). Reprinted In: Carpenter BE, Doran RW (eds) A.M. Turing’s ACE report of 1946 and other papers. MIT Press, Cambridge, pp. 20–105, c.1946. Available via http://​www.​turingarchive.​org/​browse.​php/​C/​32. Accessed 23 Mar 2017
Turing AM (1947) Lecture to L.M.S. [London Mathematical Society] (20 Feb 1947). In: The Papers of Alan Mathison Turing. King’s College Archive Centre, Cambridge. AMT/B/1. Also In: Copeland BJ (ed) The essential Turing: seminal writings in computing, logic, philosophy, artificial intelligence, and artificial life plus the secrets of Enigma. Oxford University Press, Oxford/New York. Available via http://​www.​turingarchive.​org/​browse.​php/​B/​1 (2004). Accessed 23 Mar 2017
Turing AM (1948) Intelligent machinery. In: The Papers of Alan Mathison Turing. King’s College Archive Centre, Cambridge. AMT/C/11. Also In: Copeland BJ (ed) The essential Turing: seminal writings in computing, logic, philosophy, artificial intelligence, and artificial life plus the secrets of enigma. Oxford University Press, Oxford/New York. Available via http://​www.​turingarchive.​org/​browse.​php/​C/​11 (2004). Accessed 23 Mar 2017
Turing AM (1950a) Computing machinery and intelligence. Mind 59:433–460. Reprinted In: Copeland BJ (ed) The essential Turing: seminal writings in computing, logic, philosophy, artificial intelligence, and artificial life plus the secrets of enigma. Oxford University Press, Oxford/New York (2004)
Metadaten
Titel
From Computing Machines to Learning Intelligent Machines: Chronological Development of Alan Turing’s Thought on Machines
verfasst von
Katsuhiko Sano
Mai Sugimoto
Copyright-Jahr
2017
Buch
Understanding Information

Print ISBN: 978-3-319-59089-9

Electronic ISBN: 978-3-319-59090-5

Copyright-Jahr: 2017

DOI
https://doi.org/10.1007/978-3-319-59090-5_6

Premium Partner

    Bildnachweise