Complexity of continuous space machine operations

Authors:
Damien Woods;J. Paul Gibson
Affiliations:
Boole Centre for Research in Informatics and Department of Mathematics, University College Cork, Cork, Ireland;Theoretical Aspects of Software Systems Research Group, Department of Computer Science, National University of Ireland, Maynooth, Ireland
Venue:
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Year:
2005

Citing 11
Cited 4

Parallel complexity theory

Parallel complexity theory
Structural complexity 1

Structural complexity 1
Recursion theory on the reals and continuous-time computation

Theoretical Computer Science - Special issue on real numbers and computers
Complexity and real computation

Complexity and real computation
A universal interconnection pattern for parallel computers

Journal of the ACM (JACM)
Computable analysis: an introduction

Computable analysis: an introduction
Optical Computing

Optical Computing
On the Computational Power of a Continuous-Space Optical Model of Computation

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
An optical model of computation

Theoretical Computer Science
Some effects of Fourier-domain phase quantization

IBM Journal of Research and Development
A characterization of the power of vector machines

Journal of Computer and System Sciences

Parallel and Sequential Optical Computing

OSC '08 Proceedings of the 1st 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the computational complexity of an optical model of computation called the continuous space machine (CSM). We characterise worst case resource growth over time for each of the CSM's ten operations with respect to seven resource measures. Many operations exhibit unreasonably large growth rates thus motivating restrictions on the CSM, in particular we give a restriction called the C2-CSM.