Silicon Investor (SI) -- The First Internet Community

STOCKTALK

We've detected that you're using an ad content blocking browser plug-in or feature. Ads provide a critical source of revenue to the continued operation of Silicon Investor. We ask that you disable ad blocking while on Silicon Investor in the best interests of our community. If you are not using an ad blocker but are still receiving this message, make sure your browser's tracking protection is set to the 'standard' level.

Pastimes : Let's Talk About Our Feelings!!! -- Ignore unavailable to you. Want to Upgrade?

To: epicure who wrote (76290)	3/31/2000 9:08:00 AM
From: lorrie coey	Read Replies (1) \| Respond to of 108807

How's this for a 'welcome' message, X...? "Die First came the feeling that he was being watched, but this was only an absurd notion that he toyed with occasionally. As far as he was concerned, he was enveloped in a shroud of invincibility; the idea of failure simply did not occur to him. Then his friends began to disappear and a sinking paranoia began to gnaw away at his very soul..." www.die.net ...hmmm. They used to have all this info about junkbusters and how to thwart the DarkMeat...but that's all gone since the Cookie Expose. I wonder who maintains this site. I wonder what it's actual purpose is. I am learning that everything is exactly the opposite of what it says it is, here. FTC is probing Yahoo... Who's next? FCC...? [certainly NOT Roger and Pete] -hope you're enjoying your hiatus. "see recursion" OK. Recursion \Recur"sion\ (-sh?n), n. [L. recursio. See {Recur}.] The act of recurring; return. [Obs.] --Boyle. From WordNet (r) 1.6 (wn) recursion n : (mathematics) an expression such that each term is generated by repeating a particular mathematical operation recursion /n./ See {recursion}. See also {tail* recursion}. recursion <mathematics, programming> When a function (or procedure) calls itself. Such a function is called "recursive". If the call is via one or more other functions then this group of functions are called "mutually recursive". If a function will always call itself, however it is called, then it will never terminate. Usually however, it first performs some test on its arguments to check for a "base case" - a condition under which it can return a value without calling itself. The {canonical} example of a recursive function is {factorial}: factorial 0 = 1 factorial n = n * factorial (n-1) {Functional programming languages} rely heavily on recursion, using it where a {procedural language} would use {iteration}. See also {recursion}, {recursive definition}, {tail recursion}. Oh, and 'portable' means 'survives system reboot'...cool.