I have seen this before, on one particular machine. The sound does appear
to come directly from the CPU. It isn't harmful as far as I can tell --
that same CPU has been testing for three years now, and continues to chug
along It only tends to happen on slower, older Pentiums, from what
(Off topic, when I computed that value in Landon's Calc program, my computer
PII/233 started making a weird humming noise. The noise stopped when the
calculation finished. Very strange indeed...)
I'm running Prime95 on a computer at the office, and it emits faint cricketish
noises from the
I have watched with interest the ideas flowing around for the distribution of
the prize money awarded by the EFF and how we should try and reach an
equitable
distribution.
In fact the answer is simple, the person who discovers it is *entitled* to it,
end of story. I would hope that they would
Just was thinking the other day about this... Forgive me if its been
discussed before etc.
Aren't there other "better" algorithms for finding the square of a number
besides using an FFT? Sure an FFT is great for multiplying two different
numbers, but for squaring a number isn't the case a little
Read the archives, this has been discussed 2 or 3 times before
-Original Message-
From: burlington john [mailto:[EMAIL PROTECTED]]
Sent: Wednesday, July 21, 1999 19:47
To: [EMAIL PROTECTED]
Subject: Mersenne: The sound of number searching
Hello Mersenne,
Sorry for bad english its
In fact the answer is simple, the person who discovers it is *entitled* to it,
end of story.
I agree with Gordon. We need to get *real* here. Theres nothing like
money to attract people to the search. I wouldn't mind betting that a
large percentage of seti@home people would start searching for
On Thu, 22 Jul 1999, Blosser, Jeremy wrote:
Just was thinking the other day about this... Forgive me if its been
discussed before etc.
Aren't there other "better" algorithms for finding the square of a number
besides using an FFT? Sure an FFT is great for multiplying two different
numbers,
All,
There are several things in a computer which will have their operational
parameters vary with CPU activity. The most likely ones are: audio
subsystem receiving noise coupled either directly (magnetically) into its
signal lines or via its power feed; or the load on the power regulation unit
Ya, I didn't think *that* part through. :)
When n=p (the LL test case with the size of the FFT and other things thrown
in) as opposed to n=2^p (my case), then things are a *lot* different.
-Original Message-
From: Lucas Wiman [mailto:[EMAIL PROTECTED]]
Sent: Thursday, July 22, 1999
On 22 Jul 99, at 15:24, Willmore, David wrote:
There are several things in a computer which will have their operational
parameters vary with CPU activity. The most likely ones are: audio
subsystem receiving noise coupled either directly (magnetically) into its
signal lines or via its power
At 11:35 PM 7/22/99 +0100, Brian J. Beesley wrote:
Back more or less to topic -
Oh, this is very much on topic!
when I was a computing neophyte, a
quarter of a century ago, I was told a story by an engineer working
for a major mainframe supplier. For a laugh, the development team
wired up
Assuming you're talking about doing it on a conventional computer
(1 or few processors, fixed word length, etc.), the method you propose
is at least O(2^p * p ) per squaring. This is dominated by
the first exponential term, which must be avoided at all costs.
Huge constant factors can be
12 matches
Mail list logo
