Optical Designs for Non-deterministic Turing Machines
OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
The traveling beams optical solutions for bounded NP-complete problems
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Nanotechnology based optical solution for NP-hard problems
OSC'10 Proceedings of the Third international conference on Optical supercomputing
| Hi-index | 0.00 |
The ray-tracing problem is considered for optical systems consisting of a set of refractive or reflective surfaces. It is assumed that the position and the tangent of the incident angle of the initial light ray are rational. The computability and complexity of the ray-tracing problems are investigated for various optical models. The results show that, depending on the optical model, ray tracing is sometimes undecidable, sometimes PSPACE-hard, and sometimes in PSPACE.