Re: Another way to do x^n
- From: "Julian V. Noble" <jvn@xxxxxxxxxxxx>
- Date: Sun, 21 May 2006 09:23:56 -0400
ward mcfarland wrote:
Julian V. Noble <jvn@xxxxxxxxxxxx> wrote:
It's just MADE for recursion!
depending on the depth of your FP Stack and the maximum power you want
to be able to do
Everyone knows stacks are bottomless (or topless, depending on
which bar you go to) ;-)
--
Julian V. Noble
Professor Emeritus of Physics
University of Virginia
.
- References:
- Another way to do x^n
- From: Julian V. Noble
- Re: Another way to do x^n
- From: John Doty
- Re: Another way to do x^n
- From: Julian V. Noble
- Re: Another way to do x^n
- From: ward mcfarland
- Another way to do x^n
- Prev by Date: Re: Another way to do x^n
- Next by Date: Re: Sea of Processors
- Previous by thread: Re: Another way to do x^n
- Next by thread: Re: Another way to do x^n
- Index(es):
Relevant Pages
|