Re: T-Sequence faster than APRT-CLE
- --- In firstname.lastname@example.org,
"djbroadhurst" <d.broadhurst@...> wrote:
> Non certum est, quia impossibile.Explanation: Bill's latest wriggle is this:
> A prime has to pass 2 full-period tests with 2 different seedsYet we know composite numbers that pass *all* "T-sequence" tests.
> and then it can be declared prime
Bill intends to
> program it in Java to allow for large integerswhere large, for him, means more than 8 digits.
Then he will feel the inevitable Pinch:
> When I was a graduate student of physics at the University of Texas:as late as 2000 our department of
> computational relativity STILL used Fortran to do all its calculationsof colliding neutron stars!
As an undergraduate I learned Fortran, Compass, and had a course in
Algol, because "it is the language of the future!" My first course in
High School was IBM 360 Assembly Language (because the school district
had one--that was the year before we got the PDP 1 and switched to basic
on paper tape). Those I knew still using Fortran a few years ago were
doing so because of the parallelized libraries useful on the massively
paralyzed super computers. Sometimes you write in the language used
locally, rather than what you want (e.g., 360 Assembly, Compass, ...).