Artificial Intelligence: A Philosophical IntroductionPresupposing no familiarity with the technical concepts of either philosophy or computing, this clear introduction reviews the progress made in AI since the inception of the field in 1956. Copeland goes on to analyze what those working in AI must achieve before they can claim to have built a thinking machine and appraises their prospects of succeeding. There are clear introductions to connectionism and to the language of thought hypothesis which weave together material from philosophy, artificial intelligence and neuroscience. John Searle's attacks on AI and cognitive science are countered and close attention is given to foundational issues, including the nature of computation, Turing Machines, the Church-Turing Thesis and the difference between classical symbol processing and parallel distributed processing. The book also explores the possibility of machines having free will and consciousness and concludes with a discussion of in what sense the human brain may be a computer. |
Contents
Can a machine think? | |
A hard look at the facts | |
The symbol system hypothesis | |
Freedom | |
Consciousness | |
Are we computers? | |
End User License Agreement | |
Other editions - View all
Common terms and phrases
Alan Turing algorithmically calculable analogue representations answer artefact Artificial Intelligence assertions axioms behaviour binary bits blocks causal chapter Chinese room Chinese room argument Church–Turing thesis compatibilist Connectionism connections consciousness contains CYC’s decision described device Dreyfus Eliza ENIAC example experiment expert systems fact false Figure Fodor fundamental operations Guha human brain inference input instances of gold instruction knowledge problem language learning Lenat Logic Theorist manipulation Marvin Minsky means memory mental Mind Minsky multiple realizability Mycin Neumann machine neurons Newell object output Parallel Distributed Processing pattern PDP networks perform Philosophical possible predictions premisses Pylyshyn qualia question random relevant represent robot Searle Searle’s sense sentence sequence Shrdlu simply simulation solving SSSH stored string strong symbol system symbol system hypothesis symbol-manipulator theory things thought true Turbo Turing machine Turing Test Turing’s understand Chinese universal symbol system words