Analog recurrent neural network simulation, £(log 2 n) unordered search, and bitonic sort with an optically-inspired model of computation
Damien Woods, Thomas J. Naughton, J. Paul Gibson · 2001
We prove computability and complexity results for an original model of computation. Our model is inspired by the theory of Fourier optics. We prove our model can simulate analog recurrent neural networks, thus establishing a lower bound on its computational power. We also prove some computational complexity results for searching and sorting algorithms expressed with our model.