Abstract
A new approach for formulating Al problems in a manner suitable for parallel optical computing is being developed at UCSD. This approach is contrasted to the sequential search-based algorithms, written in the programming language Prolog, to illustrate its potential advantages. As an example, let us consider a typical Al problem where the goal is to find from whom John may steal.
© 1987 Optical Society of America
PDF ArticleMore Like This
J. Jau, F. Kiamilev, Y. Fainman, S. Esener, and Sing H. Lee
TUW2 OSA Annual Meeting (FIO) 1987
K. S. Huang, B. K. Jenkins, and A. A. Sawchuk
MB5 Optical Computing (IP) 1987
M. Derstine, A. Guha, R. Ramnarayan, A. Vaid, P.R. Haugen, and A. Husain
TuA6 Optical Computing (IP) 1987