Re: Re[6]: The dumb SAI and the Semiautomatic Singularity

From: Tomaz Kristan (
Date: Mon Jul 08 2002 - 22:27:01 MDT

On Mon, 08 July 2002, Cliff Stabbert wrote:

TK>> The list of all medical situationa
TK>> is huge. But finite.

CS> So you claim. I beg to differ.
CS> If your simulation, or whatever, is
CS> based on physics, and if even a single
CS> atom can be in an infinity of
CS> states (positions, electron spin,
CS> whatever degrees of freedom quarks

For the first aid - it is definitly not so. And for the medicine as well, also not. The latest should be bigger, yes. Still very finite.

CS> could still be NP-hard.

It's not. But even if it was, it doesn't mean, it is noncomputable.

CS> I think you're overconfident of the
CS> ability of standard computational
CS> techniques to solve problems.

That is my point. You can do GA with them - can't you? Just see, what the evolution is capable of. Needs a lot of computation - but so what, if you have it?

CS> Do you program? Have you tried
CS> tackling the Traveling Salesman
CS> problem? Solve that, and I might be
CS> more convinced ;)

With GA? It's quite easy. But not the only possible way.

- Thomas

Sign up for ICQmail at

This archive was generated by hypermail 2.1.5 : Wed Jul 17 2013 - 04:00:40 MDT