Re: Why isn't James Harris working oh halting problem?

On Jun 18, 4:41 pm, tommy1729 <tommy1...@xxxxxxxxx>
wrote:
A halts if B halts

determining if A halts
depends on the halting of B
and B on C
and C on D etc

thats the basic idea of the halting problem and its
socalled unsolvability.

however the idea is WRONG !

1) there is no known algoritm A for wich an
algoritm B C AND D EXISTS !!!!
(in the sence that B C AND D are very different
from A AND EACHOTHER and thus not A repeated n times
in m steps )

2) the proof of the unsolvability is clearly a
selfreference rather than a proof.

3) mathematical proof rather occur like proving
that two opposite things dont add up, rather than
saying this is true if that is true and that is true
if this is true ...

4) iterations cannot be discribed bye totally
different iterations

iteration A can not depend on iteration B unless
there equal (see 1) ) if the iteration cannot be
rewritten in a simpler "closed form"

more promising is

A halts if B does not.

B can then not be tested bye trial , but bye
THEORY.

the idea of taking proofs to tested iterations is
childish and primitive
IN GENERAL NO GREAT MATHEMATICIAN OR PROOF HAS EVER
BEEN DONE LIKE THAT. (with a few exceptions but these
never had an A B AND C AND D , just an A or an A and
B nothing more)

another controversial topic

but i dare you to disproof 1) for any conjecture
that is (not) decidable and no closed form functions
used.


James will get the answer before you do.



nobody has given me any good answers yet.

not experts not crankpots nobody.

just giving links at best.

which i appreciate though.

i see programs as iterations.

ask any programmer:

do you write programmes defined recursively ??

most will say yes.

so i see programs as iterations.

however this conflicts with the halting problem it seems.

( since no A B C D can be given for 3n+1)

i dont doubt unsolvability or undecidability.

but i prefer the vision and proofs of gödel and matheyasevich , not the halting problem.

tommy1729
.

Relevant Pages

  • HALTING PROBLEM
    ... A halts if B halts ... thats the basic idea of the halting problem and its socalled unsolvability. ... iterations cannot be discribed bye totally different iterations ... the idea of taking proofs to tested iterations is childish and primitive ...
    (sci.math)
  • Re: Why isnt James Harris working oh halting problem?
    ... thats the basic idea of the halting problem and its ... iterations cannot be discribed bye totally ... A halts if B does not. ... so recursion is besides the point. ...
    (sci.math)
  • Re: HALTING PROBLEM
    ... halting machines ... i dont have much time. ... people understand my comparison with iterations. ... and this same kernel of an argument is used in such ...
    (sci.math)
  • Re: HALTING PROBLEM
    ... iterations cannot be discribed bye totally ... A halts if B does not. ... P is also a string; ... The halting problem is not as simple as it should be, ...
    (sci.math)
  • Why isnt James Harris working oh halting problem?
    ... thats the basic idea of the halting problem and its socalled unsolvability. ... iterations cannot be discribed bye totally different iterations ... A halts if B does not. ... the idea of taking proofs to tested iterations is childish and primitive ...
    (sci.math)
Loading