Inside Out Library · Explore

Perceptrons and Pattern Recognition (1967)

Defense Technical Information Center · leaf 81

An illustration from Perceptrons and Pattern Recognition, 1967, leaf 81
UUlUJIll n pw <0 -3- Proof i: Suppose that <KX) could have order < m. Consider an array of , - •> squares of R arranged in 2m + 1 rows of 4m“ squares each. … Let Gq be the set of points shaded in the diagram; that is, the array of points whose row indices are odd, and let be the remaining squares of the array. Let ^ be the family of figures obtained from the igure Gq by adding subsets of G^ , i.e. , F« if it is of the form G0vtv where F^C. G^. Now F…

Minsky, Marvin L · Massachusetts inst of tech cambridge project mac · Decision theory · Pattern recognition · Automata · Boolean algebra · Groups(mathematics) · Invariance · Parallel processing · Perception · Reading machines · Statistical Analysis · Threshold effects · Topology

Internet Archive · Defense Technical Information Center · Public domain (US government work). Free to use for anything.

More pictures from Perceptrons and Pattern Recognition

More like this