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

A.J. Wells

LSE Research Online Documents on Economics from London School of Economics and Political Science, LSE Library

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.

JEL-codes: B25 (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

Published in Ecological Psychology, 2005, 17(3), pp. 205-230. ISSN: 1040-7413

Downloads: (external link)
http://eprints.lse.ac.uk/16024/ Open access version. (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ehl:lserod:16024

Access Statistics for this paper

More papers in LSE Research Online Documents on Economics from London School of Economics and Political Science, LSE Library LSE Library Portugal Street London, WC2A 2HD, U.K.. Contact information at EDIRC.
Bibliographic data for series maintained by LSERO Manager ().