Optical computing and computational complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4135 LNCS, Issue , 2006, Pages 27-40

  Woods, Damien ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; FOURIER TRANSFORMS; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS;

COMPLEXITY THEORY; OPTICAL COMPUTERS; SPATIAL RESOLUTION;

OPTICAL DATA PROCESSING;

EID: 33749999506     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11839132_4     Document Type: Conference Paper

References (31)

1. H. H. Arsenault and Y. Sheng. An introduction to optics in computers, volume TT 8 of Tutorial texts in optical engineering. SPIE, 1992.
2. J. L. Balcázar, J. Díaz, and J. Gabarró. Structural complexity II, volume 22 of EATCS Monographs on Theoretical Computer Science. Springer, Berlin, 1988.
3. R. N. Bracewell. The Fourier transform and its applications. Electrical and electronic emgineering series, McGraw-Hill, second edition, 1978.
4. H. J. Caulfield. Space-time complexity in optical computing. In B. Javidi, editor, Optical information-processing systems and architectures II, volume 1347, pages 566-572. SPIE, July 1990.
5. A. K. Chandra and L. J. Stockmeyer. Alternation. In 17th annual symposium on Foundations of Computer Science, pages 98-108, Houston, Texas, Oct. 1976. IEEE. Preliminary Version.
6. D. G. Feitelson. Optical Computing: A survey for computer scientists. MIT Press, 1988.
7. L. M. Goldschlager. Synchronous parallel computation. PhD thesis, University of Toronto, Computer Science Department, Dec. 1977.
8. L. M. Goldschlager. A universal interconnection pattern for parallel computers. Journal, of the ACM, 29(4):1073-1086, Oct. 1982.
9. J. W. Goodman. Introduction to Fourier optics. McGraw-Hill, New York, second edition, 1996.
10. R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to parallel computation: P-completeness theory. Oxford university Press, Oxford, 1995.
11. R. M. Karp and V. Ramachandran. Parallel algorithms for shared memory machines, volume A. Elsevier, Amsterdam, 1990.
12. J. N. Lee, editor. Design issues in optical processing. Cambridge studies in modern optics. Cambridge University Press, 1995.
13. A. Louri and A. Post. Complexity analysis of optical-computing paradigms. Applied optics, 31(26):5568-5583, Sept. 1992.
14. A. D. McAulay. Optical computer architectures. Wiley, 1991.
15. T. Naughton, Z. Javadpour, J. Keating, M. Klíma, and J. Rott. General-purpose acousto-optic connectionist processor. 'Optical Engineering, 38(7):1170-1177, July 1999.
16. T. J. Naughton. Continuous-space model of computation is Turing universal. In S. Bains and L. J. Irakliotis, editors, Critical Technologies for the Future of Computing, Proceedings of SPIE vol. 4109, pages 121-128, San Diego, California, Aug. 2000.
17. T. J. Naughton. A model of computation for Fourier optical processors. In R. A. Lessard and T. Galstian, editors, Optics in Computing 2000, Proc. SPIE vol. 4089, pages 24-34, Quebec, Canada, June 2000.
18. T. J. Naughton and D. Woods. On the computational power of a continuous-space optical model of computation. In M. Margenstern and Y. Rogozhin, editors, Machines, Computations and Universality: Third International Conference (MCU'01), volume 2055 of LNCS, pages 288-299, Chişinǎu, Moldova, May 2001. Springer.
19. I. Parberry. Parallel complexity theory. Wiley, 1987.
20. V. R. Pratt, M. O. Rabin, and L. J. Stockmeyer. A characterisation of the power of vector machines. In Proc. 6th annual ACM symposium on theory of computing, pages 122-134. ACM press, 1974.
21. V. R. Pratt and L. J. Stockmeyer. A characterisation of the power of vector machines. Journal of Computer and Systems Sciences, 12:198-221, 1976.
22. J. H. Reif and A. Tyagi. Efficient parallel algorithms for optical computing with the discrete Fourier transform (DFT) primitive. Applied optics, 36(29):7327-7340, Oct. 1997.
23. P. van Emde Boas. Machine models and simulations. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, chapter 1. Elsevier, Amsterdam, 1990.
24. A. VanderLugt. Optical Signal Processing. Wiley Series in Pure and Applied Optics. Wiley, New York, 1992.
25. K. Weihrauch. Computable Analysis: An Introduction. Texts in Theoretical Computer Science. Springer, Berlin, 2000.
26. D. Woods. Computational complexity of an optical model of computation. PhD thesis, National University of Ireland, Maynooth, 2005.
27. th International Symposium on Algorithms and Computation (ISAAC 2005), volume 3827 of LNCS, pages 777-788, Sanya, China, Dec. 2005. Springer.
28. D. Woods and J. P. Gibson. Complexity of continuous space machine operations. In S. B. Cooper, B. Löewe, and L. Torenvliet, editors, New Computational Paradigms, First Conference on Computability in Europe (CiE 2005), volume 3526 of LNCS, pages 540-551, Amsterdam, June 2005. Springer.
29. D. Woods and J. P. Gibson. Lower bounds on the computational power of an optical model of computation. In C. S. Calude, M. J. Dinneen, G. Pǎun, M. J. Pérez-Jiménez, and G. Rozenberg, editors. Fourth International Conference on Unconventional Computation (UC'05), volume 3699 of LNCS, pages 237-250, Sevilla, Oct. 2005. Springer.
30. D. Woods and T. J. Naughton. An optical model of computation. Theoretical Computer Science, 334(1-3):227-258, Apr. 2005.
31. F. T. S. Yu, S. Jutamulia, and S. Yin, editors. Introduction to information optics. Academic Press, 2001.