

Ravi Pandya software  nanotechnology  economics 
ARCHIVES
ABOUT ME
DISCLAIMER


Sun 28 Oct 2007 There's a DNA computing group at Caltech doing some amazing work. They have defined a model for performing arbitrary Turingcomplete computation using chemical reactions by mapping a Minsky Register Machine to relative molecule counts: "Wellmixed finite stochastic chemical reaction networks with a fixed number of species can perform Turinguniversal computation with an arbitrarily low error probability. This result illuminates the computational power of stochastic chemical kinetics: errorfree Turing universal computation is provably impossible, but once any nonzero probability of error is allowed, no matter how small, stochastic chemical reaction networks become Turing universal. This dichotomy implies that the question of whether a stochastic chemical system can eventually reach a certain state is always decidable, the question of whether this is likely to occur is uncomputable in general." 07:03 # 

© 20022004 Ravi Pandya  All Rights Reserved 