A fully implicit algorithm for exact state minimization
DAC '94 Proceedings of the 31st annual Design Automation Conference
Revised Papers from the International Workshop on Membrane Computing
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
| Hi-index | 0.04 |
The feeling that the technology based on integrated circuits is slowly reaching its limits is becoming more general and the idea that we need to focus on searching completely different types of computers, e.g. quantum computers or computers based on "molecular processors", is being debated more and more. One of the research directions, mentioned above, is the calculation based on organic moleculs, especially DNA. A series of operations done on the DNA sequences (simple or with two catheti) is being controled better than ever. In 1994, L. Adleman, published the description of the procedure of finding a Hamiltonian way in a graphic, by using the reversibility of some reactions by using DNA. By communicating his realisation, two years later, took place at Princeton the most complex experiment of this type: calculating the sum of two numbers in the second basis, and from that moment on the idea of realising a molcular computer was born, meaning that a new science field was created.