not in a chatty mood really. sure it will pass.
Byyyy thisshhh time of might, sorry, night , you
may be listening but I'm not all that interesssssssssssttttttttttiiiiiiiing.
So I'm going to listen to a nice old Bobby Bland album and a bit of The Ruts
for the minute.
Just before I go, though, an ex-pal of mine who I've known since I was 14
has just brought up a few things I lent him over the years, because I asked
him to in a nice but very compelling way a short while ago.....
He didn't bring up the nice stainless steel flask that I lent him last year.
BUT.... I now have in my hand as I speak an original pressing of "All Mod
Cons" by The Jam, which apparently I lent him in 1981 and he'd forgotten all
about. And 3 good novels, and The Best of The Stranglers on vinyl.
Every cloud.....
and those lovely scams offering unlimited income
Like, look in the dictionary under "recursion", dudette. If you find it
says "see Recursion" then get back to me.
> Like, look in the dictionary under "recursion", dudette. If you find it
> says "see Recursion" then get back to me.
ahh recursion... my favorite part of computing...... oh no i've gone
crosseyed
I've yet to work out the Towers of Hanoi problem, and they shot that one at
me 11 years ago!
If anyone's got a good formal method for that. I would not only be happy,
I'd be bloody grateful to see it. I'm still trying to do the thing on the
solitaire prog, before I start playing it, instead of steaming in and
clicking!.
Two things about this:
Asking the woman you're dating about the last woman you went out with is
guaranteed to provide an undefined result. Which knacks the recursive
function at stage n-1!
Woody Allen backs up the idea that everything you can do recursively, you
can do iteratively as well: "I have learned from my mistakes to the point
that I can now repeat them exactly".
i used to have a pascal program listing for the towers of hanoi, and a
mathematical formula defining the number of turns it would take to finish
the game, but god knows where it is now
I remember that listing in the first-year textbook at uni, but it was
uncommented and I couldn't make head or tail of it. It was included, I
think, as an example of a problem that could only be solved recursively, and
not iteratively - to illustrate the point that anything you can do
iteratively, you can do recursively, but not vice versa.
I'm really pleased I remembered that, actually. I was quite stoned during
that first year of college! Wish I could remember Nicola Waterson's phone
number too. Still, I digress.
Hanoi? No wonder the Americans bombed Vietnam, that's all I've got to say!