000			04185cam a22002894a 4500
999			_c3365 _d3365
001			15486448
003			OSt
005			20191004100325.0
008			081016s2009 enka b 001 0 eng
010			_a 2008044683
020			_a9781405122887 (pbk. : alk. paper)
040			_aDLC _cDLC _dDLC
050	0	0	_aQP360.5 _b.G35 2009
082	0	0	_a612.82 GAL K _222
100	1		_aGallistel, C. R., _d1941-
245	1	0	_aMemory and the computational brain : _bwhy cognitive science will transform neuroscience / _cC. R. Gallistel and Adam Philip King.
260			_aChichester, West Sussex, UK ; _aMalden, MA : _bWiley-Blackwell, _c2009.
300			_axvi, 319 p. : _bill. ; _c25 cm.
504			_aIncludes bibliographical references (p. [288]-298) and index.
505			_aPreface. 1. Information. Shannon's Theory of Communication. Measuring Information. Efficient Coding. Information and the Brain. Digital and Analog Signals. Appendix: The Information Content of Rare Versus Common Events and Signals. 2. Bayesian Updating. Bayes' Theorem and Our Intuitions About Evidence. Using Bayes' Rule. Summary. 3. Functions. Functions of One Argument. Composition and Decomposition of Functions. Functions of More than One Argument. The Limits to Functional Decomposition. Functions Can Map to Multi-Part Outputs. Mapping to Multiple-Element Outputs Does Not Increase Expressive Power. Defining Particular Functions. Summary: Physical/Neurobiological Implications of Facts about Functions. 4. Representations. Some Simple Examples. Notation. The Algebraic Representation of Geometry. 5. Symbols. Physical Properties of Good Symbols. Symbol Taxonomy. Summary. 6. Procedures. Algorithms. Procedures, Computation, and Symbols. Coding and Procedures. Two Senses of Knowing. A Geometric Example. 7. Computation. Formalizing Procedures. The Turing Machine. Turing Machine for the Successor Function. Turing Machines for f is -even Turing Machines for f + Minimal Memory Structure. General Purpose Computer. Summary. 8. Architectures. One-Dimensional Look-Up Tables (If-Then Implementation). Adding State Memory: Finite-State Machines. Adding Register Memory. Summary. 9. Data Structures. Finding Information in Memory. An Illustrative Example. Procedures and the Coding of Data Structures. The Structure of the Read-Only Biological Memory. 10. Computing with Neurons. Transducers and Conductors. Synapses and the Logic Gates. The Slowness of It All. The Time-Scale Problem. Synaptic Plasticity. Recurrent Loops in Which Activity Reverberates. 11. The Nature of Learning. Learning As Rewiring. Synaptic Plasticity and the Associative Theory of Learning. Why Associations Are Not Symbols. Distributed Coding. Learning As the Extraction and Preservation of Useful Information. Updating an Estimate of One's Location. 12. Learning Time and Space. Computational Accessibility. Learning the Time of Day. Learning Durations. Episodic Memory. 13. The Modularity of Learning. Example 1: Path Integration. Example 2: Learning the Solar Ephemeris. Example 3: "Associative" Learning. Summary. 14. Dead Reckoning in a Neural Network. Reverberating Circuits as Read/Write Memory Mechanisms. Implementing Combinatorial Operations by Table-Look-Up. The Full Model. The Ontogeny of the Connections? How Realistic is the Model? Lessons to be Drawn. Summary. 15. Neural Models of Interval Timing. Timing an Interval on First Encounter. Dworkin's Paradox. Neurally Inspired Models. The Deeper Problems. 16. The Molecular Basis of Memory. The Need to Separate Theory of Memory from Theory of Learning. The Coding Question. A Cautionary Tale. Why Not Synaptic Conductance? A Molecular or Sub-Molecular Mechanism? Bringing the Data to the Computational Machinery. Is It Universal? References. Glossary. Index.
650		0	_aCognitive neuroscience.
650		0	_aCognitive science.
700	1		_aKing, Adam Philip.
906			_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg
942			_2ddc _cSTS