An optical model of computation

DOI10.1016/j.tcs.2004.07.001zbMath1080.68030OpenAlexW2101615041MaRDI QIDQ1779303

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 transformComputabilityComputational complexityOptical computingAnalog computationBinary searchAnalog recurrent neural networkContinuous space machineUnconventional model of computationUnordered search

Mathematics Subject Classification ID

Related Items (13)

Light-based string matching ⋮ AN ANALOGUE-DIGITAL CHURCH-TURING THESIS ⋮ On the computational power of the light: a plan for breaking data encryption standard ⋮ Computations with oracles that measure vanishing quantities ⋮ Solving the Hamiltonian path problem with a light-based computer ⋮ Lower bounds on the computational power of an optical model of computation ⋮ Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines ⋮ Interval-valued computations and their connection with PSPACE ⋮ Exact cover with light ⋮ Solving the subset-sum problem with a light-based device ⋮ Optical computing ⋮ A Survey on Analog Models of Computation ⋮ On the complexity of nonuniform wavelength-based machine

Cites Work

• Analog computation via neural networks
• Recursion theory on the reals and continuous-time computation
• Strengths and Weaknesses of Quantum Computing
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Signal detection by complex spatial filtering
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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