« Where The Revolution Went | Main | Oh, It's A PROFIT Deal . . . »

Fatboy Slim Mondegreen Flowchart

Fatboy Slim Mondegreen Flowchart

March 4, 2010 | Permalink

Comments

about now
about now
about now
about now

Posted by: Andrew Clunn | Mar 5, 2010 7:45:24 AM

I like this one AND I learned a new word :D

Posted by: tpulley | Mar 5, 2010 5:17:41 PM

I'll assume that's "mondegreen". I think the funniest thing about "mondegreen"s is that "mondegreen" is itself derived from a mondegreen.

Meta-humor (amusement derived by mixing/confusing/warping meta levels) is always fun -- for example, the notion of the recursive acronym:

Example:
MUNG, which is an acronym for

MUNG
Until
No
Good

Posted by: O Bloody Hell | Mar 5, 2010 6:44:18 PM

Must be something missing from my education....I don't get it.

I think "MUNG" ia reentrant acronym.

Posted by: Larry Sheldon | Mar 6, 2010 10:17:30 AM

It is re-entrant, but that's fairly trivial with all modern code (it means it does fresh storage allocations and doesn't change any static data storage -- i.e., constants -- so it can be run through a second time without reloading). Your computing experience must be fairly old to be using that term ;-) "Reusable, reentrable, refreshable".. LOL.

It's recursive because it calls itself.

Any code which calls itself is recursive, that's the definition. Theoretically, it's supposed to have termination conditions... which of course a recursive acronym lacks completely, ergo, it's an infinitely expanding loop. If nothing stopped it, it would crash reality... Heh.

The classic example of recursion (usually one of the first programs given in a computing class) is a factorial algorithm.

N! = f(n):
If n=1, return 1;
If n>1, then return n*f(n-1);

The n=1 is the termination condition -- it keeps calling itself with successively lower numbers until it gets to n=1, at which point it "folds back up" doing the appropriate multiplications as it pops everything off the stack. Exceedingly inefficient, but it's an easily understood example.

Recursion is a fairly powerful tool, since it can make complex problems fairly simple, but it can be a very bad thing when it's called inside of a loop "from i=1 to 1e37 step 1" :oD

Posted by: O Bloody Hell | Mar 8, 2010 8:52:59 PM

Post a comment