From newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.ecf!utgpu!csd.unb.ca!morgan.ucs.mun.ca!nstn.ns.ca!bonnie.concordia.ca!uunet!psinntp!scylla!daryl Tue Jan 21 09:26:57 EST 1992
Article 2866 of comp.ai.philosophy:
Path: newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.ecf!utgpu!csd.unb.ca!morgan.ucs.mun.ca!nstn.ns.ca!bonnie.concordia.ca!uunet!psinntp!scylla!daryl
>From: daryl@oracorp.com
Newsgroups: comp.ai.philosophy
Subject: Re: Impossibility of flight vs impossibility of AI
Message-ID: <1992Jan18.152922.18577@oracorp.com>
Date: 18 Jan 92 15:29:22 GMT
Organization: ORA Corporation
Lines: 13

Matthew Wiener writes:

>>    there is no evidence that these heuristics are non-computable.

> Sure there is: no algorithm is apparent to the mathematicians themselves.

I don't think it is sensible to think that something is impossible
just because we don't know how to do it, which was the case with
flight up until whatever year human flight was achieved.

Daryl McCullough
ORA Corp.
Ithaca, NY


