Woods, Damien and Gibson, Paul (2005) Complexity of continuous space machine operations. In: New Computational Paradigms. Springer, pp. 540-555.

Preview

Download (346kB) | Preview

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 C 2-CSM.

Item Type:	Book Section
Keywords:	Optical Model; Complexity Measure; Recursive Function; Raster Image; Digital Hologram;
Academic Unit:	Faculty of Science and Engineering > Computer Science Faculty of Science and Engineering > Research Institutes > Hamilton Institute
Item ID:	15741
Depositing User:	Damien Woods
Date Deposited:	28 Mar 2022 15:12
Publisher:	Springer
Refereed:	Yes
URI:	Publisher
Use Licence:	This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here

Repository Staff Only(login required)

Item control page

Downloads

Origin of downloads