Optical computing: a survey for computer scientists
Optical computing: a survey for computer scientists
Optical computer architectures: the application of optical concepts to next generation computers
Optical computer architectures: the application of optical concepts to next generation computers
Charles Babbage: Pioneer of the Modern Computer
Charles Babbage: Pioneer of the Modern Computer
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Lower bounds on the computational power of an optical model of computation
Natural Computing: an international journal
The computability and complexity of optical beam tracing
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Solving the subset-sum problem with a light-based device
Natural Computing: an international journal
The traveling beams optical solutions for bounded NP-complete problems
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Optical computing and computational complexity
UC'06 Proceedings of the 5th international conference on Unconventional Computation
A light-based device for solving the hamiltonian path problem
UC'06 Proceedings of the 5th international conference on Unconventional Computation
| Hi-index | 0.00 |
The construction of an optical computer that can explore the computation tree of a non-deterministic Turing machine in the time it takes to explore one path of the computation has been described in Dolev and Nir 2003. In this paper, we elaborate on the design considerations of Dolev and Nir 2003. The construction of such an optical computer will allow solving NP problems in polynomial time. The limitation is space, where every beam location (hitting a prism) represents a different Turing machine configuration. By the use of writable (holographic) memory, we are able to reduce the space only by a constant factor. Tradeoffs between the use of semantics for each location in space, and the use of digital storage is discussed. In the writable model, configurations can be represented in binary (or higher base digital) representation, rather than mapping each location in space to a single configuration. We show that, the benefit of such a digital representation in the scope of concurrent exhaustive search is limited.