Re: An uncomputability conjecture

From: Antti Ylikoski (ajy_at_cc.hut.fi)
Date: 12/23/03 

Date: Tue, 23 Dec 2003 08:35:34 +0200

"Rick Decker" <rdecker@hamilton.edu> kirjoitti
viestissä:3FE73397.8020201@hamilton.edu...
>
>
> Antti Ylikoski wrote:
>
> > Let P be a problem. P is an object in the real world,
> > ie. in the objective reality, I'm not giving any definition
> > for it, it is a fundamental concept.
[snips]
> > An interesting question is:
> > Is it the case that the function
> >
> > f: f(M) = M'
> >
> > is uncomputable?
[snips]
>
> On the contrary, as I read you, it should indeed be
> very difficult to discover a proof, since the result
> is false. You surely must be aware of the proof that
> every NTM has an equivalent DTM. The proof as usually
> presented gives an explicit and computable construction
> so your f above is indeed computable.
>
>
> <snip>
>
>
>
>
> Regards,
>
> Rick

Oh, I was being silly!!!

Thank you very much anyway!!

    Antti Ylikoski