Parallel complexity theory
Optical computing: a survey for computer scientists
Optical computing: a survey for computer scientists
Machine models and simulations
Handbook of theoretical computer science (vol. A)
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
Optical signal processing
Space-time complexity in optical computing
Multidimensional Systems and Signal Processing - Special issue on optical signal processing
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
A universal interconnection pattern for parallel computers
Journal of the ACM (JACM)
Introduction to Optical Computing
Introduction to Optical Computing
On the Power of Random Access Machines
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
On the Computational Power of a Continuous-Space Optical Model of Computation
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
A characterization of the class of functions computable in polynomial time on Random Access Machines
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Synchronous parallel computation.
Synchronous parallel computation.
An optical model of computation
Theoretical Computer Science
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
A characterization of the power of vector machines
Journal of Computer and System Sciences
Optical computing and computational complexity
UC'06 Proceedings of the 5th international conference on Unconventional Computation
Lower bounds on the computational power of an optical model of computation
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Upper bounds on the computational power of an optical model of computation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Complexity of continuous space machine operations
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
An Optical Wavelength-Based Solution to the 3-SAT Problem
OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
Incoherent Optical Spatial Image Processing
OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
An optical solution for the SAT Problem
OSC'10 Proceedings of the Third international conference on Optical supercomputing
An optical solution to the 3-SAT problem using wavelength based selectors
The Journal of Supercomputing
Hi-index | 0.01 |
We present a number of computational complexity results for an optical model of computation called the continuous space machine. We also describe an implementation for an optical computing algorithm that can be easily defined within the model. Our optical model is designed to model a wide class of optical computers, such as matrix vector multipliers and pattern recognition architectures. It is known that the model solves intractable PSPACE problems in polynomial time, and NC problems in polylogarithmic time. Both of these results use large spatial resolution (number of pixels). Here we look at what happens when we have constant spatial resolution. It turns out that we obtain similar results by exploiting other resources, such as dynamic range and amplitude resolution. However, with certain other restrictions we essentially have a sequential device. Thus we are exploring the border between parallel and sequential computation in optical computing. We describe an optical architecture for the unordered search problem of finding a one in a list of zeros. We argue that our algorithm scales well, and is relatively straightforward to implement. This problem is easily parallelisable and is from the class NC. We go on to argue that the optical computing community should focus their attention on problems within P (and especially NC), rather than developing systems for tackling intractable problems.