Re: Disproof of the Halting Problem's Conclusion

From: George Greene (greeneg_at_greeneg-cs.cs.unc.edu)
Date: 07/18/04 

Date: 18 Jul 2004 17:23:05 -0400

 : > PARAphrasing IS NOT acceptable!
 : > That "It is impossible to construct a program that can determine if every program
 : > : halts" IS NOT the halting problem's conclusion!
 : > The Halting Problem is about A TURING MACHINE (NOT a program) that
 : > decides whether every TURING MACHINE (on every input) does or doesn't halt!

"Peter Olcott" <olcott@att.net> writes:
 : That's right I am sure that you have just proved that the
 : National Institutes of Standards and Technology is totally
 : off-base.

I haven't even SAID that, let ALONE proved it.
The National Institutes of Standarsd and Technology
ALREADY KNOW that what they are talking about is Turing-Equivalent.
Only YOU are so stupid that you don't know THAT.

 : After all everyone (but me) already knows that
 : George Greene is the ultimate authority on these matters.

It is not MY authority that is being appealed to here.
Bunches of other people in the room have already told you
that the problem depends on what you called "the analyzer"
and "the analyzed" being the SAME kind of program.
Whether that kind is Turing Machine or a lambda-expression-
evaluator or whatEVER is being used at
 : http://www.nist.gov/dads/HTML/haltingProblem.html
is simply irrelevant. 

-- 
 --- The history of our nation has demonstrated that separate is seldom, if ever, equal.
 --- (Feb.3,2004) Supreme Judicial Court of Massachusetts (4-3), adv.Sen.#2175

Relevant Pages

  • Re: Contradiction or paradox
    ... and ~_is_ a wff by that definition. ... ~LTand then halts. ... The rest of the line is CBL command write with argument ... YES"Turing Machine a halts yes on input b." ...
    (sci.logic)
  • Re: Rados Sigma and the Halting Problem for Programs
    ... AD> computer language that does not contrive a logic paradox ... Halting Theorem may be proven without recourse to reductio ... computation halts, and is bottom, i.e. _|_ if the computation diverges ... Assume that from a Turing Machine M we can construct a Turing Machine ...
    (comp.theory)
  • Re: Rados Sigma and the Halting Problem for Programs
    ... AD> computer language that does not contrive a logic paradox ... Halting Theorem may be proven without recourse to reductio ... computation halts, and is bottom, i.e. _|_ if the computation diverges ... Assume that from a Turing Machine M we can construct a Turing Machine ...
    (sci.math)
  • Re: Rados Sigma and the Halting Problem for Programs
    ... AD> computer language that does not contrive a logic paradox ... Halting Theorem may be proven without recourse to reductio ... computation halts, and is bottom, i.e. _|_ if the computation diverges ... Assume that from a Turing Machine M we can construct a Turing Machine ...
    (sci.logic)
  • Re: Disproof of the Halting Problems Conclusion
    ... The "head" of a Turing machine is always located at some cell of the ... block of n+1 X's on an otherwise blank tape, M halts at the leftmost X ...
    (sci.logic)