Optical computing and computational complexity

  • Authors:

  • Damien Woods

  • Affiliations:

  • Boole Centre for Research in Informatics, School of Mathematics, University College Cork, Ireland

  • Venue:
  • UC'06 Proceedings of the 5th international conference on Unconventional Computation
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This work concerns the computational complexity of a model of computation that is inspired by optical computers. The model is called the continuous space machine and operates in discrete timesteps over a number of two-dimensional images of fixed size and arbitrary spatial resolution. The (constant time) operations on images include Fourier transformation, multiplication, addition, thresholding, copying and scaling. We survey some of the work to date on the continuous space machine. This includes a characterisation of the power of an important discrete restriction of the model. Parallel time corresponds, within a polynomial, to sequential space on Turing machines, thus satisfying the parallel computation thesis. A characterisation of the complexity class NC in terms of the model is also given. Thus the model has computational power that is (polynomially) equivalent to that of many well-known parallel models. Such characterisations give a method to translate parallel algorithms to optical algorithms and facilitate the application of the complexity theory toolbox to optical computers. In the present work we improve on these results. Specifically we tighten a lower bound and present some new resource trade-offs.