Show Summary Details

Page of

PRINTED FROM OXFORD HANDBOOKS ONLINE (www.oxfordhandbooks.com). © Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a title in Oxford Handbooks Online for personal use (for details see Privacy Policy and Legal Notice).

date: 22 November 2019

Abstract and Keywords

This chapter provides a synthetic review of a long-term effort to produce an internally consistent theory of the neural basis of human cognition, the Leabra cognitive architecture, which explains a great deal of brain and behavioral data. In a highly influential commentary, Allen Newell first issued a call for a more comprehensive, principled approach to studying cognition, saying “You can’t play 20 questions with nature and win.” His point was that cognition, and the brain that gives rise to it, are too complex and multidimensional a system for a series of narrowly framed experiments and/or models to succeed in characterizing it. Instead, a single cognitive architecture should be used to simulate a wide range of data at many levels in a cumulative manner. However, these cognitive architectures tend to be complex and difficult to fully comprehend. In an attempt to most clearly and simply present the Leabra biologically based cognitive architecture, the authors articulate 20 principles that motivate its design at multiple levels of analysis.

Keywords: computational cognitive neuroscience, computational models, learning, memory, cognition, executive function

Access to the complete content on Oxford Handbooks Online requires a subscription or purchase. Public users are able to search the site and view the abstracts and keywords for each book and chapter without a subscription.

Please subscribe or login to access full text content.

If you have purchased a print title that contains an access token, please see the token for information about how to register your code.

For questions on access or troubleshooting, please check our FAQs, and if you can''t find the answer there, please contact us.