From newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.csri.toronto.edu!rpi!usc!cs.utexas.edu!uunet!psinntp!scylla!daryl Thu Jan  9 10:33:45 EST 1992
Article 2519 of comp.ai.philosophy:
Xref: newshub.ccs.yorku.ca comp.ai.philosophy:2519 sci.philosophy.tech:1736 sci.logic:742
Newsgroups: comp.ai.philosophy,sci.philosophy.tech,sci.logic
Path: newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.csri.toronto.edu!rpi!usc!cs.utexas.edu!uunet!psinntp!scylla!daryl
>From: daryl@oracorp.com
Subject: Re: Penrose on Man vs. Machine
Message-ID: <1992Jan7.031553.24886@oracorp.com>
Organization: ORA Corporation
Date: Tue, 7 Jan 1992 03:15:53 GMT

Mikhail Zeleny writes:

> The point is not whether human beings can solve all instances of the
> halting problem, or tell whether an arbitrary collection of axioms is
> consistent, but that each time they do so in any particular case,
> their reasoning is essentially non-algorithmic, as claims Penrose.

But, as I have pointed out, the argument that human reasoning is
non-algorithmic depends on the assumption that humans can solve all
instances of the halting problem.

Daryl McCullough
ORA Corp.
301A Harris B. Dates Dr.
Ithaca, NY 14850-1313




