7. Computational Complexity and Efficient Learning

  1. Alexander Clark and
  2. Shalom Lappin

Published Online: 21 MAR 2011

DOI: 10.1002/9781444390568.ch7

Linguistic Nativism and the Poverty of the Stimulus

Linguistic Nativism and the Poverty of the Stimulus

How to Cite

Clark, A. and Lappin, S. (2011) Computational Complexity and Efficient Learning, in Linguistic Nativism and the Poverty of the Stimulus, Wiley-Blackwell, Oxford, UK. doi: 10.1002/9781444390568.ch7

Publication History

  1. Published Online: 21 MAR 2011
  2. Published Print: 7 JAN 2011

ISBN Information

Print ISBN: 9781405187848

Online ISBN: 9781444390568



  • computational complexity and efficient learning;
  • computational complexity, central in determining - whether learning is efficient for a particular task;
  • child, having limited computational resources - those of its brain/mind;
  • Van Rooij's formulation, explicitly - as the Tractable Cognition Thesis;
  • efficient learning, general questions of complexity to complexity in learning - focusing on two main concerns;
  • polynomial update time - way of filtering out clearly implausible algorithms;
  • efficient learning, when input data and computation of learning algorithm scale - for target object;
  • memory limitations, beyond limitations - computation, the learner can perform, restrictions on available memory;
  • complexity of learning, strong connection - between cryptographic and learning problems;
  • Satisfiability Testing (SAT) solvability - active area of research, in complexity theory and in applied theorem


This chapter contains sections titled:

  • Basic Concepts of Complexity

  • Efficient Learning

  • Negative Results

  • Interpreting Hardness Results

  • Summary and Conclusions