Logo - springer
Slogan - springer

Computer Science - Artificial Intelligence | Turing’s Connectionism - An Investigation of Neural Network Architectures

Turing’s Connectionism

An Investigation of Neural Network Architectures

Teuscher, Christof

2002, XXIV, 200 pp.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$149.00

(net) price for USA

ISBN 978-1-4471-0161-1

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$189.00

(net) price for USA

ISBN 978-1-85233-475-8

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • About this book

Alan Mathison Turing (1912-1954) was the first to carry out substantial re­ search in the field now known as Artificial Intelligence (AI). He was thinking about machine intelligence at least as early as 1941 and during the war cir­ culated a typewritten paper on machine intelligence among his colleagues at the Government Code and Cypher School (GC & CS), Bletchley Park. Now lost, this was undoubtedly the earliest paper in the field of AI. It probably concerned machine learning and heuristic problem-solving; both were topics that Turing discussed extensively during the war years at GC & CS, as was mechanical chess [121]. In 1945, the war in Europe over, Turing was recruited by the National Physical Laboratory (NPL)! in London, his brief to design and develop an electronic stored-program digital computer-a concrete form of the universal Turing machine of 1936 [185]. Turing's technical report "Proposed Electronic 2 Calculator" , dating from the end of 1945 and containing his design for the Automatic Computing Engine (ACE), was the first relatively complete spec­ ification of an electronic stored-program digital computer [193,197]. (The document "First Draft of a Report on the EDVAC", produced by John von Neumann and the Moore School group at the University of Pennsylvania in May 1945, contained little engineering detail, in particular concerning elec­ tronic hardware [202].

Content Level » Research

Keywords » Alan Turing - Connectionism - Hardware - Neural Networks - Random Bollean Networks - algorithms - artificial intelligence - logic

Related subjects » Artificial Intelligence - Hardware - Theoretical Computer Science

Table of contents 

Foreword by B.J. Copeland and D. Proudfoot.- INTRODUCTION: Turing's Anticipation of Connectionism. Alan Mathison Turing. Connectionism and Artificial Neural Networks. Historical Context and Related Work. Organization of the Book. Book Web-Site.- INTELLIGENT MACHINERY: Machines. Turing's Unorganized Machines. Formalization and Analysis of Unorganized Machines. New Unorganized Machines. Simulation of TBI-type Machines with MATLAB.- SYNTHESIS OF LOGICAL FUNCTIONS AND DIGITAL SYSTEMS WITH TURING NETWORKS: Combinational versus Sequential Systems. Synthesis of Logical Functions with A-type Networks. Synthesis of Logical Functions with TB-type Networks. Multiplexer and Demultiplexer. Delay-Unit. Shift-Register. How to Design Complex Systems. Hardware Implementation.- ORGANIZING UNORGANIZED MACHINES: Evolutionary Algorithms. Evolutionary Artificial Neural Networks. Example: Evolve Networks that Regenerate Bitstreams. Signal Processing in Turing Networks. Pattern Classification. Examples: Pattern Classification with Genetic Algorithms. A Learning Algorithm for Turing Networks.- NETWORK PROPERTIES AND CHARACTERISTICS: General Properties. Computational Power. State Machines. Threshold Logic. Dynamical Systems and the State-Space Model. Random Boolean Networks. Attractors. Network Stability and Activity. Chaos, Bifurcation, and Self-Organized Criticality. Topological Evolution and Self-Organization. Hypercomputation: Computing Beyond the Turing Limit with Turing's Neural Networks?- EPILOGUE.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Artificial Intelligence (incl. Robotics).