## Turings Connectionism: An Investigation of Neural Network ArchitecturesAlan 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]. |

### No grāmatas satura

1.5. rezultāts no 6.

xiv. lappuse

This book is about Turing's almost forgotten

as an ordinary diploma thesis [177] (equivalent to a Master's thesis) at the Logic

Systems Laboratory (LSL), Swiss Federal Institute of Technology Lausanne ...

This book is about Turing's almost forgotten

**connectionist**ideas. What first beganas an ordinary diploma thesis [177] (equivalent to a Master's thesis) at the Logic

Systems Laboratory (LSL), Swiss Federal Institute of Technology Lausanne ...

xv. lappuse

The book presents an in-depth analysis of Turing's

today's point of view and thus also tries to answer some questions that Turing

himself did not think of. An example is the interconnectivity of his networks: Why

does ...

The book presents an in-depth analysis of Turing's

**connectionist**ideas fromtoday's point of view and thus also tries to answer some questions that Turing

himself did not think of. An example is the interconnectivity of his networks: Why

does ...

1. lappuse

1.1 Turing's Anticipation of

little-known report entitled Intelligent Machinery [192, 195]. At that time, he was

employed at the National Physical Laboratory (NPL) in London where he ...

1.1 Turing's Anticipation of

**Connectionism**It was in 1948 that Alan Turing wrote alittle-known report entitled Intelligent Machinery [192, 195]. At that time, he was

employed at the National Physical Laboratory (NPL) in London where he ...

2. lappuse

Turing always favoured the

approach to artificial intelligence. With the failure of classical artificial intelligence,

there has been more willingness in recent years to combine both approaches ...

Turing always favoured the

**connectionist**as well as the classical programmingapproach to artificial intelligence. With the failure of classical artificial intelligence,

there has been more willingness in recent years to combine both approaches ...

4. lappuse

The growth of new connections within the brain is naturally closely related to

Turing's

overlooked for a long timebecame then a founding paper of modern non-linear

...

The growth of new connections within the brain is naturally closely related to

Turing's

**connectionist**ideas of 1948. His first paper on morphogenesis [191]-overlooked for a long timebecame then a founding paper of modern non-linear

...

### Lietotāju komentāri - Rakstīt atsauksmi

Ierastajās vietās neesam atraduši nevienu atsauksmi.

### Saturs

1 | |

Intelligent Machinery | 17 |

Synthesis of Logical Functions and Digital Systems with | 63 |

Organizing Unorganized Machines | 83 |

Network Properties and Characteristics 121 | 120 |

Epilogue | 169 |

List of Tables 181 | 180 |

Index | 197 |

### Citi izdevumi - Skatīt visu

Turings Connectionism: An Investigation of Neural Network Architectures Christof Teuscher Ierobežota priekšskatīšana - 2002 |

### Bieži izmantoti vārdi un frāzes

100-node A-type network A-type machine A-type network A-type node A-type unorganized machine artificial neural networks attractors B-type link behaviour binary bitstream boolean networks brain Church-Turing thesis clock cycles complex configuration connectionism connectionist Copeland and Proudfoot CP-type Definition Definition Definition delay described disabled dynamical systems enabled connections encoding evolution evolutionary algorithm example finite flip-flop function realized genetic algorithm hardware Hypercomputation IA and IB implementation incoming links initial node values input nodes inputs and outputs interconnection switches interfering inputs IA inverter L-system lin[t links per node lmat logical functions MATLAB monostable NAND gate network architecture network genome network nodes network output neurons output nodes parameters possible presented problem Proposition random boolean networks randomly Section self-organizing shift-register shown in Figure shows signal simple simulated stable std_logic tape TBl-type network threshold elements Turing networks Turing neural networks Turing's neural networks Two-input Typical activities universal Turing machine vector VHDL weights