Making DNA Computers Error Resistant
Report ID: TR-491-95Author: Boneh, Dan / Lipton, Richard J.
Date: 1995-05-00
Pages: 9
Download Formats: |Postscript|
Abstract:
Recently Lipton showed that the formula satisfaction problem can be solved using a DNA based computer. The algorithm ignored the effects of errors that occur during biological experiments. In this paper we show that Lipton's algorithm can be made resistant to errors. In addition, we present a new circuit satisfaction algorithm which can be made error resistant using the same techniques.