Peer-Reviewed Journal Details
Mandatory Fields
Woods, D;Naughton, TJ
2009
October
Applied Mathematics and Computation
Optical computing
Published
15 ()
Optional Fields
COMPUTATIONAL POWER TURING-UNIVERSAL LOWER BOUNDS MODEL COMPLEXITY SPACE PARALLEL SYSTEMS TIME INTERCONNECTS
215
1417
1430
In this survey we consider optical computers that encode data using images and compute by transforming such images. We give an overview of a number of such optical computing architectures, including descriptions of the type of hardware commonly used in optical computing, as well as some of the computational efficiencies of optical devices. We go on to discuss optical computing from the point of view of computational complexity theory, with the aim of putting some old, and some very recent, results in context. Finally, we focus on a particular optical model of computation called the continuous space machine. We describe some results for this model including characterisations in terms of well-known complexity classes. (C) 2009 Elsevier Inc. All rights reserved.
NEW YORK
0096-3003
10.1016/j.amc.2009.04.061
Grant Details