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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Balan, M.S., Krithivasan, K., Sivasubramanyam, Y.: Peptide computing - universality and complexity. In: Jonoska, N., Seeman, N.C. (eds.) DNA 2001. LNCS, vol. 2340, pp. 290–299. Springer, Heidelberg (2002)
Ben-Amram, A.M.: The Church-Turing thesis and its look-alikes. Sigact News 36(3), 113–114 (2005)
Cook, S.A., Aanderaa, S.O.: On the minimum computation time of functions. Trans. Amer. Math. Soc. 142, 291–314 (1969)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
Hug, H., Schuler, R.: Strategies for the developement of a peptide computer. Bioinformatics 17, 364–368 (2001)
Jürgensen, H., Katsura, M., Konstantinidis, S.: Maximal solid codes. Journal of Automata, Languages and Combinatorics 6, 25–50 (2001)
Jürgensen, H., Konstantinidis, S.: Codes. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 511–607. Springer, Berlin (1997)
Jürgensen, H., Konstantinidis, S., Lâm, N.H.: Asymptotically optimal low-cost solid codes. J. of Automata, Languages and Combinatorics 9, 81–102 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balan, M.S., Jürgensen, H. (2006). Peptide Computing – Universality and Theoretical Model. In: Calude, C.S., Dinneen, M.J., Păun, G., Rozenberg, G., Stepney, S. (eds) Unconventional Computation. UC 2006. Lecture Notes in Computer Science, vol 4135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839132_6
Download citation
DOI: https://doi.org/10.1007/11839132_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38593-6
Online ISBN: 978-3-540-38594-3
eBook Packages: Computer ScienceComputer Science (R0)