Woods, Damien and Naughton, Thomas J. (2005) An optical model of computation. Theoretical Computer Science, 334. pp. 227-258.
We prove computability and complexity results for an original model of computation called the continuous space machine. 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 dene a (log2 n) unordered search algorithm with our model.
|Keywords:||continuous space machine, unconventional model of computation, analog computation, optical computing, computability, computational complexity, analog recurrent neural network, Fourier transform, binary search, unordered search.|
|Academic Unit:||Faculty of Science and Engineering > Computer Science|
|Depositing User:||Thomas Naughton|
|Date Deposited:||21 Jun 2007|
|Journal or Publication Title:||Theoretical Computer Science|
Repository Staff Only(login required)
|Item control page|