An optical model of computation

DOI10.1016/J.TCS.2004.07.001MaRDI QIDQ1779303zbMATH OpenOpenAlexFDO

Authors Damien Woods, Thomas J. Naughton

Publication date 1 June 2005

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2004.07.001

zbMATH Keywords

Fourier transformComputational complexityComputabilityAnalog computationOptical computingBinary searchAnalog recurrent neural networkContinuous space machineUnconventional model of computationUnordered search

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 1241394
• scientific article; zbMATH DE number 1738670
• Optical Computing and Computational Complexity
• Optical computing
• Algorithms and Computation
• scientific article; zbMATH DE number 107952
• Lower bounds on the computational power of an optical model of computation
• Unconventional Computation

Cites work

• scientific article; zbMATH DE number 3917710 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1260390 (Why is no real title available?)
• scientific article; zbMATH DE number 1096865 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 1542874 (Why is no real title available?)
• scientific article; zbMATH DE number 1738670 (Why is no real title available?)
• Analog computation via neural networks
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Recursion theory on the reals and continuous-time computation
• Signal detection by complex spatial filtering
• Strengths and Weaknesses of Quantum Computing

Cited in

(22)

• On the complexity of nonuniform wavelength-based machine
• Optical Computing and Computational Complexity
• Exact cover with light
• Light-based string matching
• Lower bounds on the computational power of an optical model of computation
• Solving the Hamiltonian path problem with a light-based computer
• The logic of optics and the optics of logic
• scientific article; zbMATH DE number 1241394 (Why is no real title available?)
• Solving the subset-sum problem with a light-based device
• Optical computing
• A Survey on Analog Models of Computation
• scientific article; zbMATH DE number 1738670 (Why is no real title available?)
• Lower bounds on the complexity of the wavelength-based machine
• Interval-valued computations and their connection with PSPACE
• Circular interval-valued computers and simulation of (red-green) Turing machines
• An analogue-digital Church-Turing thesis
• An Optical Simulation of Shared Memory
• Geometrical Optics and Models of Computer Memory Fragmentation
• New Computational Paradigms
• On the computational power of the light: a plan for breaking data encryption standard
• Light ray concentration reduces the complexity of the wavelength-based machine on PSPACE languages
• Computations with oracles that measure vanishing quantities

This page was built for publication: An optical model of computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779303)