Algorists, algorithms, and complexity: an exploration of the Shavian critque of discrete state computation

Wells, A.J. (2005) Algorists, algorithms, and complexity: an exploration of the Shavian critque of discrete state computation. Ecological Psychology, 17 (3). pp. 205-230. ISSN 1040-7413

Preview

PDF Download (294kB) | Preview

• Publisher

Abstract

The status of computational theory in ecological psychology has been and continues to be a source of controversy. Over a period of more than 30 years, Robert Shaw and his colleagues have developed a powerful negative critique of computation based in part on the idea that computational theory cannot capture central aspects of the coimplicative structure of the relations between animals and their environments. Two aspects of the Shavian critique are considered in this article: the characterization of the algorist and the problem of complexity. It is argued, contrary to the critique, that computational theory offers a properly constrained formal view of the algorist and is not defeated by complexity. Computational ideas can therefore have a fundamental role to play in the further development of ecological psychology.

Item Type:	Article
Official URL:	http://www.taylorfrancis.com/journals/authors/heco...
Additional Information:	© 2005 Taylor and Francis Group
Divisions:	Psychological and Behavioural Science
Subjects:	B Philosophy. Psychology. Religion > BF Psychology
JEL classification:	B - Schools of Economic Thought and Methodology > B2 - History of Economic Thought since 1925 > B25 - Historical; Institutional; Evolutionary; Austrian
Date Deposited:	18 Sep 2008 15:22
Last Modified:	13 Sep 2024 21:55
URI:	http://eprints.lse.ac.uk/id/eprint/16024

Actions (login required)

View Item