Re: Prime counting algorithms, speculation

From: Jürgen R. (jurgenr_at_web.de)
Date: 08/04/04 

Date: Wed, 04 Aug 2004 21:22:05 GMT

On 4 Aug 2004 11:19:05 -0700, jstevh@msn.com (James Harris) wrote:

>jurgenr@web.de (Jürgen R.) wrote in message news:<4110edb4.28774195@news.individual.de>...
>> [...]
>> >
>> >My fastest prime counting program is PrimeCountH.java, which readers
>> >can easily pull up by a Google search or a Google Groups search, and
>> >it blows away ALL the times that you'll find posted on that page.
>> >
>> [... on and on]
>>
>> Just tell us how fast it is: To count the primes < N there is some
>> function F(N) such that the time taken by your program is less than
>> C*F(N) for some fixed C. Tell us what F is. If you don't know stop
>> taking about how fast your algorithm is, because in that case it is of
>> no interest at all.
>>
>> Jürgen
>
>Some sci.math poster put up a webpage claiming that I entered a
>competition to build fast prime counting programs and lost badly, when
>in fact, I never entered any competition, and actually my fastest
>implementation--PrimeCountH.java--is not only far faster than anything
>he presented on his webpage, it's been available on-line for quite
>some time.
>
>I pointed out [...blah blah blah ...]

I understand - you don't know what the asymptotic behavior of your
perported algorithm is. You could have said that in fewer words.

Jürgen
>
>James Harris
>http://mathforprofit.blogspot.com/

Relevant Pages

  • Re: Algorithms to generate permutations
    ... >>The position on algorithm design, ... > I claim that my government should not insist ... Would this have forced a US national competition? ...
    (sci.crypt)
  • Re: Fasctode - Sort estimating complexity and B&V
    ... > Estimating complexity and needed time for N elements according ... > since any algorithm is allowed to challange. ... from the competition. ... a person could always send a lot of ill-behaved entries just to ...
    (borland.public.delphi.language.basm)
  • now that was interesting
    ... That was quite a competition at the end:) ... The entry which is puzzling me most is the algorithm from Hannes ... obfuscate properly for matlab? ...
    (comp.soft-sys.matlab)
  • Re: Prime counting algorithms, speculation
    ... > in fact, I never entered any competition, and actually my fastest ... the fastest algorithm you ever published, ...
    (sci.math)
Quantcast