Article View: comp.lang.misc
Article #1394Re: It looks like he's at it again!
From: sous-realiste
Date: Mon, 30 Jul 1990 21:46
Date: Mon, 30 Jul 1990 21:46
13 lines
1314 bytes
1314 bytes
>of course, an undergraduate cs major could do it by themselves with a
>copy of knuth in hand.
>...
>additive sequences, even middle square (just for illustrative
>purposes) are all trivial (and portable) in hll's. berkeley's random
How would you do (2^n)+1 modulo sequence on an n-bit machine in an HLL?
Knuth describes how to do it in assembly, by intercepting the carry/overflow.
--
Her somber eyes consider all ||/+\==/+\|| Steven Ryan
that loom and tower, large and tall.||\=/++\=/|| ...!uunet!ingr!apd!smryan
Her everyday is always new ||/=\++/=\||...!{apple|pyramid}!garth!smryan
and fills her eyes of frail blue. ||\+/==\+/|| 2400 Geng Road, Palo Alto, CA
Technical Details
Message-ID:
<626@garth.UUCP>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!zaphod.mps.ohio-state.edu!uwm.edu!bionet!synoptics!unix!garth!smryanReferences:
<2328@l.cc.purdue.edu> <1990Jul10.072443.4844@cs.UAlberta.CA> <2618@igloo.scum.com> <2347@l.cc.purdue.edu> <TED.90Jul13112900@kythera.nmsu.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!zaphod.mps.ohio-state.edu!uwm.edu!bionet!synoptics!unix!garth!smryan From: smryan@garth.UUCP (sous-realiste) Newsgroups: comp.lang.misc Subject: Re: It looks like he's at it again! Message-ID: <626@garth.UUCP> Date: 30 Jul 90 21:46:37 GMT References: <2328@l.cc.purdue.edu> <1990Jul10.072443.4844@cs.UAlberta.CA> <2618@igloo.scum.com> <2347@l.cc.purdue.edu> <TED.90Jul13112900@kythera.nmsu.edu> Reply-To: smryan@garth.UUCP (sous-realiste) Organization: intergraph/apd in sunny california Lines: 13