Computing with motile bio-agents

Nicolau Jr., Dan V., Burrage, Kevin and Nicolau, Dan V. (2007). Computing with motile bio-agents. In: Biomedical Applications of Micro- and Nanoengineering III. Biomedical Applications of Micro- and Nanoengineering III, Adelaide, Australia, (). 11-13 December 2006. doi:10.1117/12.707691

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads
UQ315557_OA.pdf Full text (open access) application/pdf 356.15KB 0

Author Nicolau Jr., Dan V.
Burrage, Kevin
Nicolau, Dan V.
Title of paper Computing with motile bio-agents
Conference name Biomedical Applications of Micro- and Nanoengineering III
Conference location Adelaide, Australia
Conference dates 11-13 December 2006
Proceedings title Biomedical Applications of Micro- and Nanoengineering III   Check publisher's open access policy
Series Proceedings of SPIE - The International Society for Optical Engineering
Place of Publication Bellingham, WA United States
Publisher International Society for Optical Engineering
Publication Year 2007
Sub-type Fully published paper
DOI 10.1117/12.707691
Open Access Status File (Publisher version)
ISBN 0819465240
ISSN 0277-786X
Volume 6416
Total pages 1
Chapter number 24
Total chapters 36
Abstract/Summary We describe a model of computation of the parallel type, which we call 'computing with bio-agents', based on the concept that motions of biological objects such as bacteria or protein molecular motors in confined spaces can be regarded as computations. We begin with the observation that the geometric nature of the physical structures in which model biological objects move modulates the motions of the latter. Consequently, by changing the geometry, one can control the characteristic trajectories of the objects; on the basis of this, we argue that such systems are computing devices. We investigate the computing power of mobile bio-agent systems and show that they are computationally universal in the sense that they are capable of computing any Boolean function in parallel. We argue also that using appropriate conditions, bio-agent systems can solve NP-complete problems in probabilistic polynomial time.
Q-Index Code E1
Q-Index Status Provisional Code
Institutional Status Unknown

Document type: Conference Paper
Sub-type: Fully published paper
Collection: Advanced Computational Modelling Centre Publications
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in Thomson Reuters Web of Science Article
Scopus Citation Count Cited 1 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Wed, 27 Nov 2013, 04:13:11 EST by System User on behalf of Advanced Computational Modelling Centre