Re: SF: Generalized SFT's
- From: "Tim Peters" <tim.one@xxxxxxxxxxx>
- Date: Mon, 25 Apr 2005 12:20:01 -0400
[Mark Atherton]
[...]
> I think that it is possible that even JSH recognises, perhaps
> subconsciously, that ultimately this is one claim he can't defend. Either
> he factorizes an RSA challenge number or he slinks off. Hmmm, wonder which
> one to put my money on... Probably neither - he'll just start ignoring his
> failure with SFT and declare that he has proven/disproven the Riemann
> hypothesis. Judging from an earlier thread he's not sure yet which it will
> be.
My money's on "neither" too, except I expect it's already settled into the
same rut as his prime-counting algorithm: he'll continue insisting it's a
major result, cheery year after cheery year, despite that nothing comes of
it. Ya, I know he already wrote:
Unlike any of my other research it's not like I can just go on
indefinitely proclaiming that the SFT is this huge threat.
Something has to happen.
If nothing happens, then I'm wrong.
but there's no deadline on that. Even if there were, who believes he'd
honor his word? Back on 23 January:
...
It's a brilliant idea. No matter what any poster says in reply,
what I've already shown is simply brilliant, as I have x, a factor
of M, defined by factors of numbers other than M, and that is the
start.
...
Now we are beyond brilliant into the arena of almost impossible to
imagine, with a technique for factoring, which loops through the
entire field of rationals in searching for a solution.
...
All of that is easy to prove, and not only did I prove it in a
paper, I wrote a program that does it.
...
I'm a person not just making claims--I have the full demonstration
of everything I say here, and I've worked it out, and put it out
for people to consider.
... [the usual "lying mathematicians" rant, followed by the
usual revenge fantasies] ...
It's not "pure math", so some of those people you respect and
admire may soon be in jail, hated worldwide, and villified by
people who will not be able to comprehend their behavior.
...
There are probably only a few days before many of your heroes are
cast down, humiliated, ripped from their positions, and put up on
public display as enemies of humanity itself, as people too blind
to act in the best interests of society, and too dumb to realize
they wouldn't get away with it.
That was all about a sequence of methods he gave up on, not because the "few
days" passed without anything happening, but because he _did_ have an
implementation, and so couldn't even lie to himself about its failures.
This time he is "just making claims", has no demonstration of anything, and
adamantly refuses to try. That way he can keep on "just making claims"
indefinitely. If anyone else tries it and sees poor results, well, they're
incompetent or lying. Par for the JSH course, so I expect he's happy to sit
right where he is on this one.
.
- References:
- Re: SF: Generalized SFT's
- From: Tim Peters
- Re: SF: Generalized SFT's
- From: Mark Atherton
- Re: SF: Generalized SFT's
- Prev by Date: Re: infinity problem
- Next by Date: Re: Program to generate Pi
- Previous by thread: Re: SF: Generalized SFT's
- Next by thread: Re: SF: Generalized SFT's
- Index(es):