From Silicon to Bio-molecular Computing
Several problems from mathematics and computer sciences e.g. Harmonic Series, Tower of Hanoi and Traveling Salesman Problem require huge amount of memory and lot of computational power. Several attempts have been made to solve the TSP, however no silicon chip based solution has been found so far, this famous problem however has been solved by Leonard Adleman using DNA computation. Our paper calls for the attention of Bio-Information experts and Computer Scientists for making a model of computation for such problems.
First we discuss few famous problems from Mathematics and Computer Science and algorithm for their solutions. Finally we will comment on DNA computing.