Re: What is an algorithm?

From: Nicola <nvitacolonna_at_gmail.com>
Date: Tue, 08 Apr 2014 09:11:19 +0200
Message-ID: <nvitacolonna-560947.09111808042014_at_freenews.netfront.net>


In article <b1884ba4-186d-4610-a4f9-95793bf45389_at_googlegroups.com>,  vldm10 <vldm10_at_yahoo.com> wrote:

> On Thursday, March 27, 2014 9:29:10 AM UTC+1, Nicola wrote:
> > In article <76aefd37-be75-4f98-9f55-afed3ddddc9a_at_googlegroups.com>,
> >
> > vldm10 <vldm10_at_yahoo.com> wrote:
> >
> >
> >
> > > I found on the Web papers that are trying to give a definition of the
> >
> > > algorithm.
> >
> > > The papers are from Yuri Gurevich, Microsoft Research. Roughly speaking
> > > Y.
> >
> > > Gurevich is working on the definition of the algorithm. He proved the
> > > Church-
> >
> > > Turing thesis.
> >
> >
> >
> > It would be more appropriate to say that he provides convincing arguments
> > that
> >
> > the Church-Turing thesis is true. The Church-Turing theory cannot be
> > "proved":
> >
> > it is not a theorem.
>
> I was on a way, so I could not respond to your post.
>
> Gurevich has one paper that is called "Proving Church's thesis".

I wasn't aware of that paper. I, too, think that those axioms are debatable. And, as I've already said in a previous reply, I do not think they change the status of the Church-Turing thesis that much.

Nicola

Received on Tue Apr 08 2014 - 09:11:19 CEST

Original text of this message