Turing Compliant?

[Gordon McMillan]

Bryan VanDeVen wrote:

> Gordon McMillan wrote:
...
> > Well there's biological computation, in which each fork() grows it's
> > own "CPU", thus making some formerly non-computable problems
> > computable.
> 
> I have heard of some experiments with biological computing - most
> taking advantange of the much higher information density that can be
> achieved using DNA, for instance, but I am very skeptical of the claim
> that this adds something fundamentally new.  Any pointers to a proof? 

No experiments, just theory. Grow a new "cell" for each 
decomposition of the problem. With a bit of overhead, you're getting 
close to solving problems of exponential complexity in linear time.

'Course you have to feed the damn thing.

- Gordon