Turing’s Connectionism

  • Teuscher C
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Turing's connectionism provides a detailed and in-depth analysis of Turing's almost forgotten ideas on connectionist machines. In a little known paper entitled "Intelligent Machinery", Turing already investigated connectionist models as early as 1948. Unfortunately, his work was dismissed by his employer as a "schoolboy essay" and went unpublished until 1968, 14 years after his death.In this book, Christof Teuscher analyzes all aspects of Turing's "unorganized machines". Turing himself also proposed a sort of genetic algorithm to train the networks. This idea has been resumed by the author and genetic algorithms are used to build and train Turing's unorganized machines. Teuscher's work starts from Turing's initial ideas, but importantly goes beyond them. Many new kinds of machines and new aspects are considered, e.g., hardware implementation, analysis of the complex dynamics of the networks, hypercomputation, and learning algorithms.

Cite

CITATION STYLE

APA

Teuscher, C. (2002). Turing’s Connectionism. Turing’s Connectionism. Springer London. https://doi.org/10.1007/978-1-4471-0161-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free