Re: Can the 'Turing Problem' be deflated?

On Mar 31, 4:45 pm, J Jones <jonescard...@xxxxxxx> wrote:


"The TM either halts or does not engage in computation."

That should suffice. The statement is analytic -

In the first place, you don't know the definition of "analytic".
Analytic statements are provable BY DEFINITION, but that
may require you to actually KNOW the definitions of the
terms in the statements.

its proof is self-evident.

Only if you actually KNOW the definition of "engage
in computation", and possibly not even then.
In any case, YOU DON'T know the definition of "engage
in computation". You probably don't know the definition of TM
either. And how does any of this relate to what you were
saying BEFORE, about how a TM halts "between" EVERY
step of the process?? By YOUR (incorrect) definition,
every TM is always halting all the time, so there are no
TMs around to fail to "engage in computation".


.

Relevant Pages

  • Re: Can the Turing Problem be deflated?
    ... george wrote: ... That should suffice. ... Analytic statements are provable BY DEFINITION, ... It's bedtime now so I will just quickly say that I would not want to say that a machine halts between computations. ...
    (sci.logic)
  • Re: HALTING DISPROOF
    ... > Assume a simple infinite set of all TMs. ... The problem is that the set of demonstrably halting functions DH is a proper ... UTMhalts. ... TM2 never halts either. ...
    (comp.theory)
  • Re: Yet another Attempt at Disproving the Halting Problem
    ... Because TMs can ALWAYS be applied to themselves, ... stems from somewhere else ... ... >> of the decidability of the halting problem, ...
    (comp.theory)
  • Re: Yet another Attempt at Disproving the Halting Problem
    ... Because TMs can ALWAYS be applied to themselves, ... stems from somewhere else ... ... >> of the decidability of the halting problem, ...
    (sci.logic)
  • Re: The proof that I was referring to is on the website
    ... >> entirely different execution trace than the exact same TM the returns ... >> its result to the TM being analyzed for this specific Halting Problem. ... If you don't tell it that it halts, ... it will fail in both cases. ...
    (comp.theory)