From newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.ecf!utgpu!cs.utexas.edu!wupost!darwin.sura.net!Sirius.dfn.de!fauern!unido!mcsun!news.funet.fi!sunic!seunet!kullmar!pkmab!ske Tue Jan 28 12:18:22 EST 1992
Article 3191 of comp.ai.philosophy:
Xref: newshub.ccs.yorku.ca comp.ai.philosophy:3191 sci.philosophy.tech:1978
Path: newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.ecf!utgpu!cs.utexas.edu!wupost!darwin.sura.net!Sirius.dfn.de!fauern!unido!mcsun!news.funet.fi!sunic!seunet!kullmar!pkmab!ske
>From: ske@pkmab.se (Kristoffer Eriksson)
Newsgroups: comp.ai.philosophy,sci.philosophy.tech
Subject: Re: Is understanding algorithmic?
Message-ID: <6523@pkmab.se>
Date: 27 Jan 92 22:08:04 GMT
References: <DIRISH.92Jan18155827@jeeves.math.utah.edu> <1992Jan26.010642.24883@smsc.sony.com> <1992Jan26.014607.8073@husc3.harvard.edu>
Organization: Peridot Konsult i Mellansverige AB, Oerebro, Sweden
Lines: 18

In article <1992Jan26.014607.8073@husc3.harvard.edu> zeleny@zariski.harvard.edu (Mikhail Zeleny) writes:
>In article <1992Jan26.010642.24883@smsc.sony.com> markc@smsc.sony.com (Mark Corscadden) writes:
 >>  Analogously, I'd like to suggest that
 >>someone who believes it possible to prove that Turing machines cannot
 >>refer help me to apply such a proof, step by step, to the scenario above.
 >
 >  Your machines merely succeed in matching an internal
 >representation of the laboratory location, as well as of some objects
 >likely to be found there with a preprogrammed description, perhaps through
 >the use of a visual pattern matching algorithm.

This is merely an assertion, not the application of a proof that Mark
Corscadden asked for.

-- 
Kristoffer Eriksson, Peridot Konsult AB, Hagagatan 6, S-703 40 Oerebro, Sweden
Phone: +46 19-13 03 60  !  e-mail: ske@pkmab.se
Fax:   +46 19-11 51 03  !  or ...!{uunet,mcsun}!mail.swip.net!kullmar!pkmab!ske


