Mersenne Digest Tuesday, 9 March 1999 Volume 01 : Number 525
----------------------------------------------------------------------
From: "David J. Fred" <[EMAIL PROTECTED]>
Date: Mon, 08 Mar 1999 22:09:55 -0500
Subject: Re: Mersenne: Re: Alien stuff
>From: Lars Soezueer <[EMAIL PROTECTED]>
>
>There have been many attempts to construct such languages.
>I am not aware of any of these projects to be
>especially designed for communication with aliens.
This is getting a little far afield, but...
Chapter 26 of David Kahn's "The Codebreakers," revised and updated
1996, touches on several proposed systems.
One called Lincos was created by Dr. Hans Freudenthal of the
University of Utrecht in the late '50s. Lincos stands for lingua
cosmica. The language was fully fleshed-out in a book by
Dr. Freudenthal called "Lincos: Design of a Language for Cosmic
Intercourse," North-Holland Publishing, 1960.
Another system was proposed by Lancelot Hogben in the early '50s at
the request of the British Interplanetary Society. His was called
Astraglossa and was discussed in "The Journal of the British
Interplanetary Society," IX (November 1952).
It is not entirely clear that either of these would actually be
practical language systems as described, but it is evident that work
has been done in this general direction.
Regards,
David
- --
Unofficial GIMPS Graphical Status Page -- http://ic.net/~djf/mers/
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
------------------------------
From: Bryan Fullerton <[EMAIL PROTECTED]>
Date: Mon, 8 Mar 1999 23:14:11 -0500
Subject: Re: Mersenne: Mersenne Processor
On Mon, Mar 08, 1999 at 08:03:27PM -0500, Jason Stratos Papadopoulos
<[EMAIL PROTECTED]> wrote:
> On Sun, 7 Mar 1999 [EMAIL PROTECTED] wrote:
>
> > If one were to build a microprocessor SPECIFICALLY suited to LL testing,
> > what would the assembly instruction set look like? Approximately what
> > would the architecture look like? Speed shouldn't be an issue because
> > there's never enough anyway and we're trying to work smarter not harder.
>
[liberal snippage]
>
> Unfortunately, I just described the UltraSPARC, the Alpha and the PII.
[...]
Ok, so why aren't there UltraSPARC and Alpha PrimeNet clients?
Brayn
- --
Bryan Fullerton http://www.samurai.com/
Owner, Lead Consultant http://www.feh.net/
Samurai Consulting http://www.icomm.ca/
"No, we don't do seppuku." Can you feel the Ohmu call?
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
------------------------------
From: Colin Percival <[EMAIL PROTECTED]>
Date: Mon, 08 Mar 1999 21:30:27 -0800
Subject: Mersenne: Re: Mersenne Processor
At 05:06 PM 08/03/99 -0800, Jason Stratos Papadopoulos wrote:
>On Sun, 7 Mar 1999 [EMAIL PROTECTED] wrote:
>> If one were to build a microprocessor SPECIFICALLY suited to LL testing,
>> what would the assembly instruction set look like? Approximately what
>> would the architecture look like? Speed shouldn't be an issue because
>> there's never enough anyway and we're trying to work smarter not harder.
>[...]
>Unfortunately, I just described the UltraSPARC, the Alpha and the PII.
>If you *insist* on a do-it-yourself job, look into Analog Devices'
>SHARC line of DSP chips, they kick butt for high-bandwidth integer math.
I disagree. There are a large number of features that could be
eliminated from modern CPUs if we only wanted to run LL tests, and there
are other features -- larger registers, larger multipliers -- which should
be added.
If I were designing a CPU specifically for LL tests, I'd include
a) a memory prefectch instruction and a 32K prefetch cache (ie, it only
caches data which it was told to prefetch).
b) 16 32-bit control/address registers and 16 128-bit data registers
c) 128x128 bit (pipelined) multiply modulo a convinient 128-bit prime
d) 128-bit add/subtract modulo said prime
e) a VLIW architecture.
Then I would run FFTs over GF(hardwired prime).
I would not include non-blocking caches, branch prediction, out of order
execution, register renaming, or any other similar features, since they are
designed to help out unpredictable, compiler-generated code; FFTs are
highly predictable, and the code for them can be optimized well.
Colin Percival
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
------------------------------
From: Henrik Olsen <[EMAIL PROTECTED]>
Date: Tue, 9 Mar 1999 08:31:57 +0100 (CET)
Subject: Re: Mersenne: Mersenne Processor
On Mon, 8 Mar 1999, Bryan Fullerton wrote:
> On Mon, Mar 08, 1999 at 08:03:27PM -0500, Jason Stratos Papadopoulos
><[EMAIL PROTECTED]> wrote:
> > On Sun, 7 Mar 1999 [EMAIL PROTECTED] wrote:
> >
> > > If one were to build a microprocessor SPECIFICALLY suited to LL testing,
> > > what would the assembly instruction set look like? Approximately what
> > > would the architecture look like? Speed shouldn't be an issue because
> > > there's never enough anyway and we're trying to work smarter not harder.
> >
> [liberal snippage]
> >
> > Unfortunately, I just described the UltraSPARC, the Alpha and the PII.
> [...]
>
> Ok, so why aren't there UltraSPARC and Alpha PrimeNet clients?
>
> Brayn
Nobody's given one to George Woltman yet?
- --
Henrik Olsen, Dawn Solutions I/S
URL=http://www.iaeste.dk/~henrik/
Get the rest there.
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
------------------------------
From: Henk Stokhorst <[EMAIL PROTECTED]>
Date: Tue, 09 Mar 1999 09:36:27 +0100
Subject: Mersenne: VME claim
L.S.,
With regards to the claim made by VME, Brian Beesley and I asked them to
produce a factor of M(727). They did not come up with a factor. Instead
they came up with the following (mass) reply which I leave to everyone's
own thoughts. They also attached a letter in .gif format which can be
viewed at http://home.wxs.nl/~tha/Mersenne/endorse.gif
YotN,
Henk Stokhorst.
- -----
Meganet P-Time Deterministic Primality Test endorsed by world renowned
mathematician.
In response to your email inquiring about our Polynomial Time 100%
Deterministic Prime Testing, we have attached the endorsement for that
method. The attachment is in GIF format, and can be viewed or printed
from
any browser.
The method was reviewed and endorsed by a world renowned mathematician,
Professor Jaime Milstein.
Professor Jaime Milstein is a top ranking government mathematician, who
won
a medal from the president last year for his achievements for the
country.
He have published many articles in different publications, such as
"Linear
Algebra and its applications" published by Moshe Goldberg.
Professor Jaime Milstein have reviewed the method, described the work as
novel and intriguing, and highly recommends its implementation.
Professor
Jaime Milstein also submitted the work to another top ranking
mathematician
for an independent review, and he concurred with his findings.
The attached endorsement includes Professor Jaime Milstein conclusion
about
the algorithm, along with his mailing address and phone number. However,
we
ask that prior to calling him you'll give us a call to schedule such a
call,
as we'd like to respect his time.
This endorsement was sent to you since you inquired about our
mathematical
proof. It should be sufficient for a mathematician to accept our claims.
If you're interested in commercially implementing the algorithm for
commercial purposes, we'll be more than glad to discuss it further with
you,
and disclose the mathematics behind it to you. However, if your interest
is
purely scientific, this endorsement should be sufficient.
Keep in mind that leading research facilities are already examining this
algorithm for commercial use, and that this method is a worldwide
mathematical breakthrough.
You can contact us by either replying to [EMAIL PROTECTED], or calling
us at 818-757-3890.
Thank you for your interest in Meganet Corporation.
Saul.
- -----
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
------------------------------
End of Mersenne Digest V1 #525
******************************
