Peptide computing: universality and theoretical model

Authors:
M. Sakthi Balan;Helmut Jürgensen
Affiliations:
Department of Computer Science, The University of Western Ontario, London, Ontario, Canada;Department of Computer Science, The University of Western Ontario, London, Ontario, Canada
Venue:
UC'06 Proceedings of the 5th international conference on Unconventional Computation
Year:
2006

Citing 6
Cited 0

Codes

Handbook of formal languages, vol. 1
Maximal solid codes

Journal of Automata, Languages and Combinatorics
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Peptide Computing - Universality and Complexity

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Asymptotically optimal low-cost solid codes

Journal of Automata, Languages and Combinatorics
The Church-Turing thesis and its look-alikes

ACM SIGACT News

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new simulation of Turing machines by peptide-antibody interactions. In contrast to a simulation presented previously, this new technique simulates the computation steps automatically and does not rely on a “look-and-do” approach, in which the Turing machine program would be interpreted by an extraneous computing agent. We determine the resource requirements of the simulation. Towards a precise definition for peptide computing we construct a new theoretical model. We examine how the simulations presented in this paper fit this model. We prove that a peptide computing model can be simulated by a Turing machine under certain conditions.