![]() |
CiteULike | ![]() |
Scis0000002's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
On the universality of peptide computingby: Sakthi, Helmut Jürgensen
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractAbstract We present a simulation of Turing machines by peptide–antibody interactions. In contrast to an earlier simulation, this new technique simulates the computation steps automatically by the interaction between peptides and antibodies 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 fits this model. We also give conditions on the peptide computing model so that it can be simulated by a Turing machine.
BibTeX record
RIS record