Parallel Computing by Xeroxing on Transparencies
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.
KeywordsTruth Table Linear Time Algorithm Truth Setting Transparent Plastic Sheet Segment Table
Unable to display preview. Download preview PDF.
- 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.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
- 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
- 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