Upper bounds on the computational power of an optical model of computation

  • Authors:

  • Damien Woods

  • Affiliations:

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

  • Venue:
  • ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present upper bounds on the computational power of an optical model of computation called the $\mathcal{C}_{2}$-CSM. We show that $\mathcal{C}_{2}$-CSM time is no more powerful than sequential space, thus giving one of the two inclusions that are necessary to show that the model verifies the parallel computation thesis. Furthermore we show that $\mathcal{C}_{2}$-CSMs that simultaneously use polynomial space and polylogarithmic time decide no more than the class NC.