Skip to main content

Neural Computations That Support Long Mixed Sequences of Knowledge Acquisition Tasks

  • Conference paper
Theory and Applications of Models of Computation (TAMC 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5532))

  • 596 Accesses

Abstract

In this talk we shall first give a brief review of a quantitative approach to understanding neural computation [4-6]. We target so-called random access tasks, defined as those in which one instance of a task execution may need to access arbitrary combinations of items in memory. Such tasks are communication intensive, and therefore the known severe constraints on connectivity in the brain can inform their analysis.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Amer. Math. Soc. 43, 439–561 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  2. Graham, B., Willshaw, D.: Capacity and information efficiency of the associative net. Network: Comput. Neural Syst. 8, 35–54 (1997)

    Article  MATH  Google Scholar 

  3. Feldman, V., Valiant, L.G.: Experience-induced neural circuits that achieve high capacity. Neural Computation (to appear, 2009)

    Google Scholar 

  4. Valiant, L.G.: Circuits of the Mind. Oxford University Press, Oxford (1994, 2000)

    Google Scholar 

  5. Valiant, L.G.: Memorization and association on a realistic neural model. Neural Computation 17(3), 527–555 (2005)

    Article  MATH  Google Scholar 

  6. Valiant, L.G.: A quantitative theory of neural computation. Biological Cybernetics 95(3), 205–211 (2006)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Valiant, L.G. (2009). Neural Computations That Support Long Mixed Sequences of Knowledge Acquisition Tasks. In: Chen, J., Cooper, S.B. (eds) Theory and Applications of Models of Computation. TAMC 2009. Lecture Notes in Computer Science, vol 5532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02017-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02017-9_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02016-2

  • Online ISBN: 978-3-642-02017-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics