The Connection Machine development effort was initiated in the belief that parallel processing and artificial intelligence could together accelerate the rate of progress toward truly intelligent machines. This progress is the result of the ease with which the machine can be programmed and the dramatic increase in compute power that the machine can bring to bear. The authors have been able to run many trials of experiments in instances where previously, running just one would have been considered an achievement and no further experimentation would have been done. This has enabled exploring a great many more hypotheses and to work on much larger problems that had been possible on previous-generation artificial intelligence workstations. The ease of programming is in part the result of a decision to use existing serial machines (the Symbolics 3600 or Digital Equipment Corporation VAX), thus leaving unchanged the operating systems, editors, file systems, debuggers, network communications systems, and so on, so as to provide familiar programming environments. The Connection Machine is programmed in conservative extensions of Common Lisp and C. Users familiar with these languages and with front-end computer systems have been able to produce results on the Connection Machine on the first day that theymore » use it.« less
[1]
M. E. Maron,et al.
An evaluation of retrieval effectiveness for a full-text document-retrieval system
,
1985,
CACM.
[2]
Guy E. Blelloch,et al.
CIS: A Massively Concurrent Rule-Based System
,
1986,
AAAI.
[3]
Michael Lebowitz.
Categorizing numeric information for generalization
,
1985
.
[4]
Craig Stanfill,et al.
Parallel free-text search on the connection machine system
,
1986,
CACM.
[5]
Stephen Wolfram,et al.
Theory and Applications of Cellular Automata
,
1986
.
[6]
David L. Waltz,et al.
Toward memory-based reasoning
,
1986,
CACM.
[7]
Arthur L. Samuel,et al.
Some Studies in Machine Learning Using the Game of Checkers
,
1967,
IBM J. Res. Dev..
[8]
Terrence J. Sejnowski,et al.
NETtalk: a parallel network that learns to read aloud
,
1988
.
[9]
W. Daniel Hillis,et al.
Data parallel algorithms
,
1986,
CACM.
[10]
W. Daniel Hillis,et al.
The connection machine
,
1985
.
[11]
Gary Sabot.
Bulk Processing of Text on a Massively Parallel Computer
,
1986,
ACL.
[12]
James B. Salem,et al.
Thermodynamics and Hydrodynamics of Cellular Automata
,
2010
.
[13]
William A. Woods,et al.
Computational Linguistics Transition Network Grammars for Natural Language Analysis
,
2022
.