Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Recursion : complexity in cognition
Roeper T., Speas M., Springer Publishing Company, Incorporated, New York, NY, 2014. 267 pp. Type: Book (978-3-319050-85-0)
Date Reviewed: Jan 7 2015

In 2002, Hauser, Chomsky and Fitch hypothesized that the narrow faculty of language “only includes recursion and is the only uniquely human component of the faculty of language.” This hypothesis led to a rich research program that challenges this claim and aims to discover the formal properties of the narrow faculty of language and explores the ways in which the narrow language faculty interfaces with language use and interpretation systems.

The papers in this well-edited and well-written book are the results of a 2009 conference at the University of Massachusetts, Amherst. The conference brought together specialists in computational linguistics, syntax, language acquisition, psychology, semantics, biology, and philosophy with the goal of developing an interdisciplinary approach to support or refute the claims made by the original Hauser, Chomsky, Fitch hypothesis. In the discussion at the conference, three distinct themes emerged: direct versus indirect recursion and labeling; constraints on recursion--functional categories and the lexicon; and conditions imposed by the interfaces.

This volume contains 11 research papers and is not divided further along these themes. There is however an additional, excellent introduction by Margaret Speas that organizes and summarizes the papers around computational questions; syntactic questions; and interfaces, acquisition, and evolution.

While in some cases the practice of publishing a relatively loose collection of research papers in book form can be questionable, this is certainly not the case here. The excellent introductory paper by Speas puts the following main research papers in context by summarizing their main ideas and contributions. This motivates readers to further explore the ideas of the authors and allows readers to quickly discover papers that may interest them.

Overall, I highly recommend this well-edited collection to researchers and students interested in this topic.

Reviewer:  Burkhard Englert Review #: CR143057 (1504-0265)
Bookmark and Share
  Reviewer Selected
Featured Reviewer
 
 
Program And Recursion Schemes (F.3.3 ... )
 
 
Linguistics (J.5 ... )
 
 
Recursive Function Theory (F.4.1 ... )
 
 
Natural Language Processing (I.2.7 )
 
Would you recommend this review?
yes
no
Other reviews under "Program And Recursion Schemes": Date
The design of divide and conquer algorithms
Smith D. Science of Computer Programming 5(1): 37-58, 1985. Type: Article
Dec 1 1985
Decidable properties of monadic recursive schemas with a depth parameter
Gonczarowski J. Acta Informatica 22(3): 277-310, 1985. Type: Article
Oct 1 1987
Necessary and sufficient conditions for the universality of programming formalisms
Kfoury A., Urzyczyn P. Acta Informatica 22(4): 347-377, 1985. Type: Article
Mar 1 1987
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy