Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
