Algorithmic Bioprocesses pp 631-637

Part of the Natural Computing Series book series (NCS)

Parallel Computing by Xeroxing on Transparencies

Chapter

Abstract

We illustrate a procedure for solving instances of the Boolean satisfiability (SAT) problem by xeroxing onto transparent plastic sheets. Suppose that m clauses are given in which n variables occur and that the longest clause contains k literals. The associated instance of the SAT problem can be solved by using a xerox machine to form only n+2k+m successive transparencies. The applicability of this linear time algorithm is limited, of course, by the increase in the information density on the transparencies when n is large. This same scheme of computation can be carried out by using photographic or other optical processes. This work has been developed as an alternate implementation of procedures previously developed in the context of aqueous (DNA) computing.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cook SA (1971) The complexity of theorem-proving procedures. In: Proceedings of the 3rd annual ACM symposium on theory of computing. Association for Computing Machinery, New York, pp 151–158 CrossRefGoogle Scholar
  2. 2.
    Garey MR, Johnson DS (1979) Computers and intractability—a guide to the theory of NP-completeness. Freeman, San Francisco MATHGoogle Scholar
  3. 3.
    Head T (2001) Splicing systems, aqueous computing, and beyond. In: Antoniou I, Calude CS, Dineen MJ (eds) Unconventional models of computation UMC’2K. Springer, Berlin, pp 68–84 Google Scholar
  4. 4.
    Head T (2002) An aqueous algorithm for finding the bijections in a binary relation. In: Brauer W, Ehrig H, Karhumaki J, Salomaa A (eds) Formal and natural computing: essays dedicated to Grzegorz Rozenberg. Lecture notes in computer science, vol 2300. Springer, Berlin, pp 354–360 Google Scholar
  5. 5.
    Head T (2007) Photocomputing: explorations with transparency & opacity. Parallel Process Lett 17:339–347 CrossRefMathSciNetGoogle Scholar
  6. 6.
    Head T, Gal S (2006) Aqueous computing: writing on molecules dissolved in water. In: Chen J, Jonoska N, Rozenberg G (eds) Nanotechnology: science and computation. Springer, Berlin, pp 321–331 CrossRefGoogle Scholar
  7. 7.
    Head T, Rozenberg G, Bladergroen R, Breek CKD, Lomerese PHM, Spaink H (2000) Computing with DNA by operating on plasmids. Bio Syst 57:87–93 Google Scholar
  8. 8.
    Head T, Chen X, Yamamura M, Gal S (2002) Aqueous computing: a survey with an invitation to participate. J Comput Sci Technol 17:672–681 MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Henkel C, Bladergroen R, Balog C, Deelder A, Head T, Rozenberg G, Spaink H (2005) Protein output for DNA computing. Nat Comput 4:1–10 MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Pagano AM, Gal S (2007) An approach for using modified nucleotides in aqueous DNA computing. In: Proceedings of the 13th international computing workshop, Memphis, TN Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  1. 1.Mathematical SciencesBinghamton UniversityBinghamtonUSA

Personalised recommendations