Re: Theme One Program • Jets and Sharks • (1)
Example 5. Jets and Sharks (cont.)
As we saw last time, Theme One reads the text file shown below and constructs a cactus graph data structure in computer memory. The cactus graph represents a single logical formula in propositional calculus and that proposition embodies the logical constraints defining the Jets and Sharks data base.
Our cactus graph incorporates a vocabulary of 41 logical terms, each of which represents a boolean variable, so the proposition in question, call it is a boolean function of the form Given we know a truth table for takes over two trillion rows and a venn diagram for takes the same number of cells. Topping it off, there are boolean functions of the form and is just one of them.
Measures of strategy are clearly needed to negotiate patches of cacti like those.
To be continued …
- McClelland, J.L. (2015), Explorations in Parallel Distributed Processing : A Handbook of Models, Programs, and Exercises, 2nd ed. (draft), Stanford Parallel Distributed Processing Lab. Online, Section 2.3, Figure 2.1.
- McClelland, J.L., and Rumelhart, D.E. (1988), Explorations in Parallel Distributed Processing : A Handbook of Models, Programs, and Exercises, MIT Press, Cambridge, MA. “Figure 1. Characteristics of a number of individuals belonging to two gangs, the Jets and the Sharks”, p. 39, from McClelland (1981).
- McClelland, J.L. (1981), “Retrieving General and Specific Knowledge From Stored Knowledge of Specifics”, Proceedings of the Third Annual Conference of the Cognitive Science Society, Berkeley, CA.
- Theme One Program • Overview
- Theme One Program • Exposition
- Theme One Program • User Guide
- Theme One Program • Survey Page
- Example. Jets and Sharks (odt) (pdf)