World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

PHOTOCOMPUTING: EXPLORATIONS WITH TRANSPARENCY AND OPACITY

    We continue to search for methods of parallel computing using light. An algorithm for solving instances of the Boolean satisfiability problem is given and illustrated using a photocopying machine with plastic transparencies as medium. The algorithm solves satisfiability problems in linear time but requires the assumption that information can be stored with a density that is exponential in the number of variables in the problem instance. Consideration is given to situations in which this density limitation is not quite absolute.

    References

    • T. Head, Unconventional Models of Computation UMC'SK, eds. I. Antoniou, C. S. Calude and M. J. Dineen (Springer, London, 2001) pp. 68–84. CrossrefGoogle Scholar
    • T. Head and S. Gal, Nanotechnology: Science and Computation, eds. J. Chen, N. Jonoska and G. Rozenberg (Springer, 2006) pp. 321–331. CrossrefGoogle Scholar
    • S.   Gal et al. , Current Developments in Mathematical Biology , Series in Knots and Everything   38 , eds. K.   Mahdavi , R.   Culshaw and J.   Boucher ( World Scientific , Singapore , 2007 ) . Google Scholar
    • T. Headet al., Aqueous solutions of algorithmic problems: emphasizing knights on a 3 × 3, DNA Computing - 7th International Workshop2340, LNCS, eds. N. Jonoska and N. C. Seeman (Springer, 2001) pp. 191–202. Google Scholar
    • T. Headet al., J. Computer Sci. & Tech. 17, 672 (2002). Crossref, ISIGoogle Scholar
    • A. M.   Pagano and S.   Gal , An approach for using modified nucleotides in aqueous DNA computing , Proceedings of the 13th International DNA Computing Workshop ( 2007 ) . Google Scholar
    • D. Schultes, Natural Computing 5, 67 (2005). CrossrefGoogle Scholar
    • M.   Oltean , Natural Computing   . Google Scholar
    • M.   Oltean , Natural Computing   . Google Scholar
    • S. A. Cook, The complexity of theorem-proving procedures, Proc. 3rd Ann. ACM Symp. on Theory of Computing (Assoc. for Computing Machinery, New York, 1971) pp. 151–158. Google Scholar
    • M. R.   Garey and D. S.   Johnson , Computers and Intractability - A Guide to the Theory of NP-Completeness ( W.H. Freeman & Co. , San Francisco , 1979 ) . Google Scholar
    • J. Hartmanis, Bulletin EATCS 55, 136 (1995). Google Scholar