Abstract
We present lower 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 at least as powerful as 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 at least the class NC.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balcázar, J.L., DÃaz, J., Gabarró, J.: Structural Complexity, vols I and II. EATCS Monographs on Theoretical Computer Science. Springer, Berlin (1988)
Chandra, A.K., Stockmeyer, L.J.: Alternation. In: 17th annual symposium on Foundations of Computer Science, Houston, Texas, October 1976, pp. 98–108. IEEE, Los Alamitos (1976); Preliminary Version
Goldschlager, L.M.: Synchronous parallel computation. PhD thesis, University of Toronto, Computer Science Department (December 1977)
Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to parallel computation: P-completeness theory. Oxford university Press, Oxford (1995)
Karp, R.M., Ramachandran, V.: Parallel algorithms for shared memory machines. In: van Leeuwen[13], vol. A (1990)
Naughton, T.J.: Continuous-space model of computation is Turing universal. In: Bains, S., Irakliotis, L.J. (eds.) Critical Technologies for the Future of Computing, Proceedings of SPIE, San Diego, California, August 2000, vol. 4109 (2000)
Naughton, T.J.: A model of computation for Fourier optical processors. In: Lessard, R.A., Galstian, T. (eds.) Optics in Computing 2000, Proc. SPIE, Quebec, Canada, June 2000, vol. 4089, pp. 24–34 (2000)
Naughton, T.J., Woods, D.: On the computational power of a continuous-space optical model of computation. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 288–299. Springer, Heidelberg (2001)
Parberry, I.: Parallel complexity theory. Wiley, Chichester (1987)
Pratt, V.R., Rabin, M.O., Stockmeyer, L.J.: A characterisation of the power of vector machines. In: Proc. 6th annual ACM symposium on theory of computing, pp. 122–134. ACM press, New York (1974)
Pratt, V.R., Stockmeyer, L.J.: A characterisation of the power of vector machines. Journal of Computer and Systems Sciences 12, 198–221 (1976)
van Emde Boas, P.: Machine models and simulations. In: van Leeuwen [13], vol. A (1990)
van Leeuwen, J. (ed.): Handbook of Theoretical Computer Science, vol. A. Elsevier, Amsterdam (1990)
Woods, D.: Computational complexity of an optical model of computation. PhD thesis, National University of Ireland, Maynooth, Submitted (2004)
Woods, D., Gibson, J.P.: Complexity of continuous space machine operations. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 540–551. Springer, Heidelberg (2005)
Woods, D., Naughton, T.J.: An optical model of computation. Theoretical Computer Science 334(1–3), 227–258 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Woods, D., Gibson, J.P. (2005). Lower Bounds on the Computational Power of an Optical Model of Computation. In: Calude, C.S., Dinneen, M.J., Păun, G., Pérez-JÃmenez, M.J., Rozenberg, G. (eds) Unconventional Computation. UC 2005. Lecture Notes in Computer Science, vol 3699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560319_22
Download citation
DOI: https://doi.org/10.1007/11560319_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29100-8
Online ISBN: 978-3-540-32022-7
eBook Packages: Computer ScienceComputer Science (R0)