你又在摸鱼了对《Memory and the Computational Brain》的笔记(8)
-
Information
hmmmmm
The continuous case
Mutual information
Information and the Brain
computation can, while the converse may not be the case. As a practical matter, it can usually accomplish it better. That is why there is no technological push to create better analog computers.
-
第55页 Representation
The representing system and the represented system, together with the functions that map between them, constitute a representation, provided three conditions are met:
- The mapping from entities in the represented system to their symbols in the representing system is causal (as, for example, when light reflected off an object in the world acts on sensory receptors in an eye causing neural signals that eventuate in a percept of the object).
- The mapping is structure preserving: The mapping from entities in the represented system to their symbols is such that functions defined on the represented entities are mirrored by functions of the same mathematical form between their corresponding symbols. Structure-preserving mappings are called homomorphisms.
- Symbolic operations (procedures) in the representing systems are (at least some- times) behaviorally efficacious: they control and direct appropriate behavior within, or with respect to, the represented system.
-
第73页 Physical Properties of Good Symbols
Distinguishability
Constructability: A computing machine can only have a finnite nnumber of actual symbols in it, but it must be so constructed that the set of possible symbols from which those actual symbols come is essenntially infinite.
Compactness: Analog coding is daunting because the damand on physical resources grows in proportion to the number of durations that we want to distinguish. The same resources can be put to much better use by a symbol-construction scheme in which the number of distinguishable symbols grows exponentially with the physical resources required. rate coding vs. place coding
Efficacy: because symbols are the stuff of computation, they must be physically efficacious within the mechanisms that implement basic functions. That is, the outputs produced by computational mechanisms (the physical realization of functions) must be determined by their inputs.
-
第79页 Symbol Taxonomy
Atomic data: irreducible physical forms that can be constructed and distinguished in a representing system.
Data strings: ordered forms composed of one or more of these atomic elements
Nominal synbols: data strings that map to their referents in the represented system in an arbitrary way, a mapping that is not constrained by any generative principles.
Encoding symbols: are related to their referents by some organized and generative principles.
Data structures: often called expressions in the philosophical and logical literature, are symbol strings that have referents by virtue of the referents of the symbols out of which they are composed annd the arrangemennt of those symbols.
-
第99页 Procedures
memory, memory
-
第100页 Two Senses of Knowing
Symbolic knnowing: transparent, the symbols carry information gleaned from experience forward in time in a manner that makes it accessible to computation. The information needed to inform behavior is either explicit in the symbols that carry it forward or may be made explicity by computationns that take those symbols as inputs.
Proceduarl "knowing": e.g., inn the search tree implementation of fis_even. State 5 “knows” that the first bit in the input was a ‘0’ and the second bit was a ‘1’, not because it has symbols carrying this information but instead because the procedure would never have entered that state were that not the case. We, who are gods outside the pro- cedure, can deduce this by scrutinizing the procedure, but the procedure does not symbolize these facts. It does not make them accessible to some other procedure.
-
第155页 Data Structures
The Turing machine architecture is not a plausible model for an efficient memory, as this sequential acess (searching through all of memory to find what is needed) would simply be too slow. All modern computers use the random-acess model of memory.
-
第241页 The Modularity of Learning
3 examples:
Learning by path integration
Learning by fitting an innately specified function to observational data
Pavlovian conditioning paradigm
你又在摸鱼了的其他笔记 · · · · · · ( 全部254条 )
- The Whole Fish Cookbook
- 4
- Urban Watercolor Sketching
- 2
- 油画棒画得比油画还棒:印象派静物教程
- 1
- 色粉画技法
- 1
- Linear Algebra with Applications, 5th Edition
- 1
- Metaphors We Live By
- 1
- The Algebraic Mind
- 19
- Storytelling with Data
- 7
- Encyclopedia of Human Behavior, Second Edition, 3 Volume Set
- 1
- 阴阳师典藏合集
- 1
- Calculus for Biology and Medicine
- 4
- RePresentations
- 1
- Vision
- 8
- Concepts
- 11
- The Conceptual Mind
- 9
- Vision Science
- 77
- What If?
- 3
- The Sense of Style
- 1
- The Professor Is In
- 8
- Mistakes Were Made
- 2
- Love and Math
- 6
- Neuroscience
- 3
- In Search of Memory
- 6
- Statistics for The Behavioral and Social Sciences
- 1
- 不确定世界的理性选择
- 1
- Atlas Shrugged
- 8
- 银河帝国:基地
- 5
- 错把妻子当帽子
- 5
- 认知心理学及其启示
- 3
- Psychology and Life (20th Edition)
- 46