| dc.contributor.author | Fahlman, Scott E. | |
| dc.date.accessioned | 2008-08-26T16:19:08Z | |
| dc.date.available | 2008-08-26T16:19:08Z | |
| dc.date.issued | 1975-11 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/41995 | |
| dc.description | This report describes research done at the Artificial Intelligence Laboratory of the Massachusetts Institute of Technology. Support for the laboratory's artificial intelligence research is provided in part by the Advanced Research Projects Agency of the Department of Defense under Office of Naval Research contract N00014-75-C-0643. | en |
| dc.description.abstract | This paper is intended as a supplement to AI MEMO 331, "A System for Representing and Using Real-World Knowledge". It is an attempt to redefine and clarify what I now believe the central theme of the research to be. Briefly, I will present the following points:
1. The operation of set-intersection, performed upon large pre-existing sets, plays a pivotal role in the processes of intelligence.
2. Von Neumann machines intersect large sets very slowly. Attempts to avoid or speed up these intersections have obscured and distorted the other, non-intersection AI problems.
3. The parallel hardware system described in the earlier memo can be viewed as a conceptual tool for thinking about a world in which set-intersection of this sort is cheap. It thus divides many AI problems by factoring out all elements that arise solely due to set-intersection. | en |
| dc.description.sponsorship | MIT Artificial Intelligence Laboratory
Department of Defense Advanced Research Projects Agency | en |
| dc.language.iso | en_US | en |
| dc.publisher | MIT Artificial Intelligence Laboratory | en |
| dc.relation.ispartofseries | MIT Artificial Intelligence Laboratory Working Papers, WP-115; | |
| dc.title | The Intersection Problem | en |
| dc.type | Working Paper | en |
