Advertisement

Peptide Computing – Universality and Theoretical Model

  • M. Sakthi Balan
  • Helmut Jürgensen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4135)

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

Peptide Sequence Turing Machine Basic Reaction Input Symbol Peptide System 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    Ben-Amram, A.M.: The Church-Turing thesis and its look-alikes. Sigact News 36(3), 113–114 (2005)CrossRefGoogle Scholar
  3. 3.
    Cook, S.A., Aanderaa, S.O.: On the minimum computation time of functions. Trans. Amer. Math. Soc. 142, 291–314 (1969)CrossRefMathSciNetMATHGoogle Scholar
  4. 4.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)MATHGoogle Scholar
  5. 5.
    Hug, H., Schuler, R.: Strategies for the developement of a peptide computer. Bioinformatics 17, 364–368 (2001)CrossRefGoogle Scholar
  6. 6.
    Jürgensen, H., Katsura, M., Konstantinidis, S.: Maximal solid codes. Journal of Automata, Languages and Combinatorics 6, 25–50 (2001)MathSciNetMATHGoogle Scholar
  7. 7.
    Jürgensen, H., Konstantinidis, S.: Codes. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 511–607. Springer, Berlin (1997)Google Scholar
  8. 8.
    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)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • M. Sakthi Balan
    • 1
  • Helmut Jürgensen
    • 1
    • 2
  1. 1.Department of Computer ScienceThe University of Western OntarioLondonCanada
  2. 2.Institut für InformatikUniversität PotsdamPotsdamGermany

Personalised recommendations