Subject:
|
Re: On the recursive subdivision of two-dimensional food items
|
Newsgroups:
|
lugnet.off-topic.geek
|
Date:
|
Mon, 23 Aug 2004 21:43:54 GMT
|
Viewed:
|
1281 times
|
| |
|
|
In lugnet.off-topic.geek, Todd Lehman wrote:
> Last night at IHOP,
Recursively speaking. I saved this reply so I could enjoy it all over again.
See, by ignoring this post, thus savoring the experience, I held off in replying
so I could cherish the moment. Until I was ready to pop-stack. THEN, I look over
and see, oh wow, I'm not done. There is a thread and I can proportionately
distribute and re-distribute the enjoyment until I seek recursive re-employ of
the savour.
It's really quite simple.
I'm mean look now! Wow, all those replies. (covers and re-covers with hand)
So it goes like this,
If the savour equals Epsilon, and N= the known value of pop-stack. Then
recursively divide to to reach the maximun savour; Epsilon. Using Time and
Savour Porportionality as the divisible factors.
Easy. Yet brilliant in the elegance of execution.
Much like my LEGO collection. The Monkey set is of course a great example.
e
www.biomechanicalbricks.com
|
|
Message is in Reply To:
14 Messages in This Thread:
 
  
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
