Re: A theorem can't be wrong

N. Silver wrote:
> JSH wrote:
>
> > It seems odd that I need to remind that a theorem cannot be
> > wrong. So the surrogate factoring theorem (SFT) cannot be
> > wrong. Now the issue of how well it factors can be raised,
> > but that's separate from it's "pure" validity as a theorem.
>
> Yep. Posters, here, have addressed the issue of its worth.
> In their opinions, it does not appear as a blip on the radar
> screen. They have tested it and point out that it has not
> factored anything non-trivial faster than at random. You
> claim to know science. So, you should understand.

So you focus on the practical question of factoring.

Is that all that matters then, practicality?

Just curious.


James Harris

.

Relevant Pages

  • Re: A theorem cant be wrong
    ... >>> It seems odd that I need to remind that a theorem cannot be ... > So you focus on the practical question of factoring. ... There is no general statement to characterize what makes a ...
    (sci.math)
  • Re: A theorem cant be wrong
    ... >>> It seems odd that I need to remind that a theorem cannot be ... > So you focus on the practical question of factoring. ... Entertainment value matters much more than practicality ...
    (sci.math)
  • Re: using MISC (post 1987 Forth hardware) opcodes
    ... just a jump and the machines all have had jump instructions. ... What makes this simple is factoring ... that this would enforce factoring ... He's suggesting an idiom that might possibly help remind people to ...
    (comp.lang.forth)
  • Re: A factoring algorithm
    ... In article, vernonner3voltazim writes: ... >/* The algorithm here is based on the known fact that ... and is an odd number (factoring an even number is ...
    (sci.math)
  • Re: Surrogate factoring, surprising result
    ... if j is odd and M is odd. ... Factoring was never really a hard problem. ...
    (sci.math)