Computation with optical sensitive sheets

In this paper, we provide a new optical model for computation, which is named filter machine. Filter machine consists of optical filters as data storage and imaging operation for computation. Each filter is a long optical sensitive sheet, divided into cells. Filter cells may represent different patterns of opaque and transparent cells which are constructed by emitting light to some cells and made them opaque. The computation in filter machines starts from basic filters with basic patterns of opaque and transparent cells. We provide an algorithm that, given a Boolean circuit, produces a filter machine generating output of the circuit for all possible inputs. Thus, we show that the filter machine is able to generate every Boolean function. Indeed, the number of required cells in each filter is exponential according to the number of variables in the given Boolean function. In order to show the efficiency of the model in solving combinatorial problems, we provide a solution for the k-clique problem on graphs by filter machines, which requires polynomial time and number of filters but exponential number of cells in each filter.

[1]  Saeed Jalili,et al.  An Optical Polynomial Time Solution for the Satisfiability Problem , 2012, OSC.

[2]  Shlomi Dolev,et al.  The Traveling Beams Optical Solutions for Bounded NP-Complete Problems , 2007, FUN.

[3]  Shlomi Dolev,et al.  Masking traveling beams: Optical solutions for NP-complete problems, trading space for time , 2010, Theor. Comput. Sci..

[4]  M. Oltean,et al.  Optical solutions for linear Diophantine equations , 2009 .

[5]  Thomas J. Naughton,et al.  Optical computing , 2009, Appl. Math. Comput..

[6]  Sama Goliaei,et al.  Light Ray Concentration Reduces the Complexity of the Wavelength-Based Machine on PSPACE Languages , 2013, UCNC.

[7]  Rami Puzis,et al.  Nanotechnology Based Optical Solution for NP-Hard Problems , 2010, OSC.

[8]  Mihai Oltean,et al.  Light-based string matching , 2009, Natural Computing.

[9]  Wolfgang Osten,et al.  An optical solution for the traveling salesman problem. , 2007, Optics express.

[10]  Mihai Oltean,et al.  Solving the Hamiltonian path problem with a light-based computer , 2007, Natural Computing.

[11]  Saeed Jalili,et al.  Light-based solution for the dominating set problem. , 2012, Applied optics.

[12]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[13]  Saeed Jalili,et al.  Optical Graph 3-Colorability , 2010, OSC.

[14]  Saeed Jalili,et al.  An optical solution to the 3-SAT problem using wavelength based selectors , 2010, The Journal of Supercomputing.

[15]  R Barakat,et al.  Polynomial convolution algorithm for matrix multiplication with application for optical computing. , 1987, Applied optics.

[16]  John H. Reif,et al.  Energy complexity of optical computations , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[17]  Mihai Oltean,et al.  An Optical Solution for the SAT Problem , 2010, OSC.

[18]  Saeed Jalili,et al.  An OpticalWavelength-Based Computational Machine , 2013, Int. J. Unconv. Comput..

[19]  Saeed Jalili,et al.  An Optical Wavelength-Based Solution to the 3-SAT Problem , 2009, OSC.