……. The future of Computing
By
Priya Parmar Paromita Bhattacharyya email: priya.parmar2389@gmail.com email:tan389@gmail.com contact no: 9820154325 contact no:9967585813
Aparna Dey Suparna Dey
email: dey07.aparna@gmail.com email:dey09.suparna@gmail.com
contact no: 7738329854 contact no:7738329847
B.E electronics,Mumbai university
Terna engineering college,Nerul,Navi Mumbai,
DNA COMPUTING...FUTURE of COMPUTING
Priya Parmar,Paromita Bhattacharyya,Aparna Dey,Suparna Dey
B.E electronics,Mumbai university
Terna engineering college,Nerul,Navi Mumbai,Maharashtra,India priya.parmar2389@gmail.com tan389@gmail.com
dey07.aparna@gmail.com
dey09.suparna@gmail.com
Abstract-Silicon microprocessors have been the heart of computing world for more than forty years. Computer chip manufacturers are furiously racing to make the next microprocessor that will topple speed records and in the process are cramming more and more electronic devices onto the microprocessor. Sooner or later the physical speed and miniaturization limits of silicon microprocessors are bound to hit a wall.
Chipmakers need a new material to produce faster computing speed with fewer complexities. You won’t believe where scientists have found this new material. DNA, the material our genes are made of, is being used to build the next generation of microprocessors. Scientists are
References: [1]Leonard M. Adleman (1994-11-11). "Molecular Computation Of Solutions To Combinatorial Problems". Science 266 (11): 1021–1024. doi:10.1126/science.7973651. — The first DNA computing paper. Describes a solution for the directed Hamiltonian path problem. [2] Dan Boneh, Christopher Dunworth, Richard J. Lipton, and Jiri Sgall (1996). "On the Computational Power of DNA". DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science 71. — Describes a solution for the boolean satisfiability problem. [3] Lila Kari, Greg Gloor, Sheng Yu (January 2000). "Using DNA to solve the Bounded Post Correspondence Problem". Theoretical Computer Science 231 (2): 192–203. — Describes a solution for the bounded Post correspondence problem, a hard-on-average NP-complete problem. [4] Lovgren, Stefan (2003-02-24). "Computer Made from DNA and Enzymes". National Geographic. Retrieved 2009-11-26. [5] Martyn Amos (June 2005). Theoretical and Experimental DNA Computation. Springer. ISBN 3-540-65773-8. — The first general text to cover the whole field.