DNA Biosoft Computing

抄録

This paper presents and discusses the first attempts to design a DNA computer, basically from the pionnering work of Len Adleman (Hamiltonian path problem with lab experiments) and then of Richard Lipton (SAT problem, Boolean formulae). Though DNA computers perform individual operations slowly, they use the same massive parallelism that is found in nature, in every living cell. Molecular computers are still in their infancy, they have raised enthusiasm and expectations. But also, active research is now trying to cope with two main types of obstructions: physical (difficulties to deal with large scale systems and coping with errors) and logical (versatility and efficiency to accomodate a wide variety of computational problems).