Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-09T21:57:51.016Z Has data issue: false hasContentIssue false

Machine Models for Cognitive Science

Published online by Cambridge University Press:  01 April 2022

R. J. Nelson*
Affiliation:
Department of Philosophy, Case Western Reserve University

Extract

Introduction. During the past two decades philosophers of psychology have considered a large variety of computational models for philosophy of mind and more recently for cognitive science. Among the suggested models are computer programs, Turing machines, pushdown automata, linear bounded automata, finite state automata and sequential machines. Many philosophers have found finite state automata models to be the most appealing, for various reasons, although there has been no shortage of defenders of programs and Turing machines. A paper by Arthur Burks (1973) convinced me long ago that “all natural human functions” are, or can be fruitfully modeled to be, finite state automata with output. Further work in the field has reinforced this conviction. There is room, however, for the use of any of the above models in philosophy of mind and in the ongoing development of cognitive science.

Information

Type
Research Article
Copyright
Copyright © 1987 by the Philosophy of Science Association

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable