Dna Computing

Essay specific features





Written by:

Eric R


Date added:

November 14, 2012








No of pages / words:

2 / 521


Was viewed:

5095 times


Rating of current essay:

Essay content:

[This is a potentially infinite grid of cells (finite state automata) communicating with their neighbors and operating in parallel.)] For example, a strand of DNA can be viewed as encoding the contents of a Turing machine tape Rewriting this tape, according to the rules in the finite control of the machine, can be done via a sophisticated scheme of enzymatic reactions...
displayed 300 characters

Custom written essay

All essays are written from scratch by professional writers according to your instructions and delivered to your email on time. Prices start from $11.99/page

Order custom paper

Full essays database

You get access to all the essays and can view as many of them as you like for as little as $28.95/month

Buy database access

Order custom writing paper now!

  • Your research paper is written
    by certified writers
  • Your requirements and targets are
    always met
  • You are able to control the progress
    of your writing assignment
  • You get a chance to become an
    excellent student!

Get a price guote


However, most of these proofs make assumptions that are not realistic from a practical viewpoint, such as error-free operations. They are, therefore, not directly applicable to engineering a DNA computer. Also, most of them do not seem to exploit the parallelism in DNA reactions very well. However, these proofs do illustrate that there are many possible architectures for DNA computers Thus, one should be careful when generalizing observations about a particular architecture or method of DNA computing to the whole field...
displayed 300 characters

General issues of this essay:

Related essays: