1 Oct
2008
1 Oct
'08
10:38 a.m.
Throw the "no free lunch"-theorem on top of that.
http://en.wikipedia.org/wiki/No_free_lunch_theorem
On Wed, Oct 1, 2008 at 3:33 PM, Dominic Steinitz
Adrian Neumann
writes: I often wonder how many cuts you need to divide a steak in n pieces. You can obviously get n pieces with (sqrt n) cuts by cutting a grid. But I'm sure some smart mathematician thought of a (log n) way.
You might try the ham sandwich theorem http://en.wikipedia.org/wiki/Ham_sandwich_theorem as an hors d'oeuvre.
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
-- Patience is the last resort for those unable to take action