Ravi Pandya
ravi@iecommerce.com
www.iecommerce.com
+1 425 417 4180
vcard
syndicate this site
ARCHIVES
2007
11
10
2004
10
09
08
07
06
2003
04
02
01
2002
12
11
10
09
08
2001
11
ABOUT ME
Ravi Pandya
Architect
Cloud Computing Futures
Microsoft
ravip at microsoft.com
| 03- | Microsoft |
| 00-02 | Covalent |
| 97-00 | EverythingOffice |
| 96-97 | Jango |
| 93-96 | NetManage |
| 89-93 | Xanadu |
| 88-89 | Hypercube |
| 84,85 | Xerox PARC |
| 83-89 | University of Toronto, Math |
| 86-87 | George Brown College, Dance |
| 95- | Foresight Institute |
| 97- | Institute for Molecular Manufacturing |
DISCLAIMER
The opinions expressed here are purely my own, and do not reflect
the policy of my employer.
Sun 28 Oct 2007
There's a DNA computing group at Caltech doing some amazing work. They have defined a model for performing arbitrary Turing-complete computation using chemical reactions by mapping a Minsky Register Machine to relative molecule counts:
"Well-mixed finite stochastic chemical reaction networks with a fixed number of species can perform Turing-universal computation with an arbitrarily low error probability. This result illuminates the computational power of stochastic chemical kinetics: error-free Turing universal computation is provably impossible, but once any non-zero 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 #
© 2002-2004 Ravi Pandya | All Rights Reserved