David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Theory and Decision 6 (August):249-67 (1975)
In this paper it is argued that certain stimulus-response learning models which are adequate to represent finite automata (acceptors) are not adequate to represent noninitial state input-output automata (transducers). This circumstance suggests the question whether or not the behavior of animals if satisfactorily modelled by automata is predictive. It is argued in partial answer that there are automata which can be explained in the sense that their transition and output functions can be described (roughly, Hempel-type covering law explanation) while their behaviors are in principle not predictable short of possession of their complete histories or of information concerning present internal states by indirect observation
|Keywords||Animal Automata Behaviorism Education Finite Functionalism Learning Linguistics Metaphysics Prediction Psychology Response Stimulus Fodor, J Hempel Moore, E Putnam, H Suppes, P|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
R. J. Nelson (1980). Review Article. Synthese 43 (3):433-451.
Hugh M. Lacey (1979). Skinner on the Prediction and Control of Behavior. Theory and Decision 10 (1-4):353-385.
Gordon M. Becker (1981). Theory Construction in Psychology: The Interpretation and Integration of Psychological Data. Theory and Decision 13 (3):251.
Similar books and articles
P. J. M. (1966). Introduction to the Theory of Finite Automata. Review of Metaphysics 19 (4):814-814.
Vicki L. Lee (1988). Beyond Behaviorism. L. Erlbaum Associates.
Sasha Rubin (2008). Automata Presenting Structures: A Survey of the Finite String Case. Bulletin of Symbolic Logic 14 (2):169-209.
Jakub Szymanik & Marcin Zajenkowski (2009). Understanding Quantifiers in Language. In N. A. Taatgen & H. van Rijn (eds.), Proceedings of the 31st Annual Conference of the Cognitive Science Society.
Marcin Mostowski (1998). Computational Semantics for Monadic Quantifiers. Journal of Applied Non--Classical Logics 8 (1-2):107--121.
Mirosław Kutyłowski (1988). Finite Automata, Real Time Processes and Counting Problems in Bounded Arithmetics. Journal of Symbolic Logic 53 (1):243-258.
J.-P. Moulin (1992). Modifiable Automata Self-Modifying Automata. Acta Biotheoretica 40 (2-3):195-204.
Alan Costall (2004). From Darwin to Watson (and Cognitivism) and Back Again: The Principle of Animal-Environment Mutuality. Behavior and Philosophy 32 (1):179 - 195.
G. E. Zuriff (1976). Stimulus Equivalence, Grammar, and Internal Structure. Behaviorism 4 (1):43-52.
David J. Chalmers (1996). Does a Rock Implement Every Finite-State Automaton? Synthese 108 (3):309-33.
Added to index2009-01-28
Total downloads17 ( #147,710 of 1,699,829 )
Recent downloads (6 months)6 ( #105,649 of 1,699,829 )
How can I increase my downloads?