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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Amer. Math. Soc. 43, 439–561 (2006)
Graham, B., Willshaw, D.: Capacity and information efficiency of the associative net. Network: Comput. Neural Syst. 8, 35–54 (1997)
Feldman, V., Valiant, L.G.: Experience-induced neural circuits that achieve high capacity. Neural Computation (to appear, 2009)
Valiant, L.G.: Circuits of the Mind. Oxford University Press, Oxford (1994, 2000)
Valiant, L.G.: Memorization and association on a realistic neural model. Neural Computation 17(3), 527–555 (2005)
Valiant, L.G.: A quantitative theory of neural computation. Biological Cybernetics 95(3), 205–211 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)