Re: Surrogate factoring works very well
- From: "Jason Pawloski" <jpawloski@xxxxxxxxx>
- Date: 20 Mar 2007 20:07:42 -0700
On Mar 20, 5:36 pm, jst...@xxxxxxxxx wrote:
On Mar 19, 6:23 pm, "Joseph Ashwood" <ashw...@xxxxxxx> wrote:
"rossum" <rossu...@xxxxxxxxxxxx> wrote in message
news:71msv29u87u7nt3obsghra6t3kv2vqadkk@xxxxxxxxxx
The code does compile and run once it is all downloaded. It is very
under-commented and at first glance appears over-complex for what it
does. James has included a certain amount of monitoring/timing code
which can presumably be removed for a production version, though he
has not made it easy to do so.
The big questions then:
Does it actually factor numbers?
Yes.
What is the asymptotic speed?
I saw another reply on that issue, but the code is VERY, very rough as
I'm doing research, trying to prove the concept and then worry more
about cleaning things up.
You're trying to prove a concept by writing a program? Good luck with
that...
<snip>
.
- References:
- Surrogate factoring works very well
- From: jstevh
- Re: Surrogate factoring works very well
- From: Mark Murray
- Re: Surrogate factoring works very well
- From: rossum
- Re: Surrogate factoring works very well
- From: Joseph Ashwood
- Re: Surrogate factoring works very well
- From: jstevh
- Surrogate factoring works very well
- Prev by Date: What surrogate factoring theory now says
- Next by Date: Re: What surrogate factoring theory now says
- Previous by thread: Re: Surrogate factoring works very well
- Next by thread: Re: Surrogate factoring works very well
- Index(es):