Structural complexity 1
Optical signal processing
Analog computation via neural networks
Theoretical Computer Science
Recursion theory on the reals and continuous-time computation
Theoretical Computer Science - Special issue on real numbers and computers
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
Complexity and real computation
Complexity and real computation
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Neural networks and analog computation: beyond the Turing limit
Neural networks and analog computation: beyond the Turing limit
Computable analysis: an introduction
Computable analysis: an introduction
Interval-valued computations and their connection with PSPACE
Theoretical Computer Science
Parallel and Sequential Optical Computing
OSC '08 Proceedings of the 1st international workshop on Optical SuperComputing
Natural Computing: an international journal
Solving the subset-sum problem with a light-based device
Natural Computing: an international journal
An Optical Wavelength-Based Solution to the 3-SAT Problem
OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
Optical computing and computational complexity
UC'06 Proceedings of the 5th international conference on Unconventional Computation
Lower bounds on the computational power of an optical model of computation
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Upper bounds on the computational power of an optical model of computation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Complexity of continuous space machine operations
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Mathematical model of stored logic based computation
Mathematical and Computer Modelling: An International Journal
Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
An optical solution to the 3-SAT problem using wavelength based selectors
The Journal of Supercomputing
Lower bounds on the complexity of the wavelength-based machine
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
| Hi-index | 5.23 |
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 define a Θ(log2n) unordered search algorithm with our model.