Space-time complexity in optical computing

H. John Caulfield

doi:10.1117/12.23444

27 December 1990 Space-time complexity in optical computing

H. John Caulfield

Proceedings Volume 1347, Optical Information Processing Systems and Architectures II; (1990) https://doi.org/10.1117/12.23444
Event: 34th Annual International Technical Symposium on Optical and Optoelectronic Applied Science and Engineering, 1990, San Diego, CA, United States

Abstract

Given certain simple and well defined operations and complexity measures, the product of spatial complexity with temporal complexity must exceed a certain minimum problem complexity if that processor is to solve that problem. Some optical processors violate that condition in a favorable direction (anomalously small temporal complexity). We next extend the requirement to embrace those optical processors. In its final form, the theorem requires that the product of spatial, temporal, and fanin complexities equal or exceed the problem complexity.

Citation Download Citation

H. John Caulfield "Space-time complexity in optical computing", Proc. SPIE 1347, Optical Information Processing Systems and Architectures II, (27 December 1990); https://doi.org/10.1117/12.23444

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available