Re: "Collatz 3n+1 conjecture is unprovable" paper; one last comment

Craig Feinstein <cafeinst@xxxxxxx> wrote:
# Proginoskes wrote:
# >
# > The fact that there's a difference between what we know to be true and
# > what the proof claims to be true means the proof is wrong. So all your
# > clever observations only bury the proof deeper in the ground; they do
# > not redeem it.
# >
# > --- Christopher Heckman
#
# You are just talking and talking without meeting my challenge! If you
# can't prove that when you plug the specific case n=7 (or any number of
# your choice) into the Collatz algorithm, the algorithm will halt at one
# *without talking about what the algorithm does at each iteration*, then
# your argument that Theorem 2 in my paper is false is invalid.


"then your argument that Theorem 2 in my paper is false is invalid"...

In the Feinstein-model-of-proof, would this then
be equivalent to a proof of Theorem 2?

--Gerhard Woeginger

___________________________________________________________
Gerhard J. Woeginger http://www.win.tue.nl/~gwoegi/

.

Relevant Pages

  • Re: factoring integers on a classical computer in polynomial-time
    ... Craig Feinstein wrote: ... > The algorithm that we present for factoring integers on a classical ... In order to settle the debate, would anyone like to try to code this up ...
    (comp.theory)
  • Re: factoring integers on a classical computer in polynomial-time
    ... Craig Feinstein wrote: ... > The algorithm that we present for factoring integers on a classical ... In order to settle the debate, would anyone like to try to code this up ...
    (sci.math)
  • Re: An easy way to prove P != NP
    ... GJ Woeginger wrote: ... # the members in the set in the fastest way possible and then select the ... # minimum value in the set, then you can't beat that algorithm in speed ... All members of S are possible candidates for the minimum. ...
    (comp.theory)
  • Re: Complexity Theory for Simpletons
    ... Craig Feinstein wrote: ... to the definition of "better" used in my paper, no algorithm has been ... found that beats Meet-in-the-Middle. ... I'm afraid I can't be bothered to read your paper. ...
    (comp.theory)
  • Re: Another Reason Why Collatz is Unprovable
    ... This means that a different algorithm can be used for each ... # one might have a circuit for input instances of size 51, ... Gerhard J. Woeginger http://www.win.tue.nl/~gwoegi/ ...
    (sci.math)
Quantcast