edly, maybe it would keep us from falling in some
great big hole.
Phil
From: Ken Lloyd [mailto:[EMAIL PROTECTED]
Sent: Friday, August 22, 2008 10:53 AM
To: [EMAIL PROTECTED]; 'The Friday Morning Applied Complexity Coffee Group'
Subject: RE: [FRIAM] GridPaths, Knuth's nifty
On Aug 21, 2008, at 6:59 PM, Robert Holmes wrote:
> ..
> Here's another (famous) problem that can be answered using a top-down
> technique rather than a bottom-up: if you have a regular 8x8 chess
> board and
> you remove the bottom left and top right squares, how many ways can
> you
> cover the
22, 2008 8:19 AM
To: 'The Friday Morning Applied Complexity Coffee Group'
Subject: Re: [FRIAM] GridPaths, Knuth's nifty book & a Question
That sounds like you're saying that having an ability to predict an outcome
with certainty, a 'final cause' in that sense
d Complexity Coffee Group
Subject: Re: [FRIAM] GridPaths, Knuth's nifty book & a Question
Not quite: I'm saying that you don't need to calculate the probability of
ANY of the paths because the constraints of your problem mean that the
probabilities (whatever they are are) of all the pa
Not quite: I'm saying that you don't need to calculate the probability of
ANY of the paths because the constraints of your problem mean that the
probabilities (whatever they are are) of all the paths (however many of them
there are) MUST sum to one (because in your problem definition the path
final
On Aug 19, 2008, at 9:47 PM, Robert Holmes wrote:
> I'll take a top-down approach instead of Roger's bottom-up approach...
>
> I'm guessing that the problem has a bunch of constraints that you've
> not
> specified in your email (can't double-back, path can't crossover)
> and--most
> importantly
I'll take a top-down approach instead of Roger's bottom-up approach...
I'm guessing that the problem has a bunch of constraints that you've not
specified in your email (can't double-back, path can't crossover) and--most
importantly--you have to start at (0,0) and end at (10,10), so stopping
somewh
Very nice indeed, thanks!
-- Owen
On Aug 18, 2008, at 2:19 PM, Roger Critchlow wrote:
> On Mon, Aug 18, 2008 at 11:19 AM, Owen Densmore
> <[EMAIL PROTECTED]> wrote:
>
>> 1 - The probability for each path is calculated by looking at the
>> possible choices at each point in the path. If yo
On Mon, Aug 18, 2008 at 11:19 AM, Owen Densmore <[EMAIL PROTECTED]> wrote:
> 1 - The probability for each path is calculated by looking at the
> possible choices at each point in the path. If you see a "3" at a
> node, for example, the probability assigned to the next move is 1/3.
> The total p
Lately I've been puzzling on the intersection between computing/
algorithms and mathematics. This lead me to look at:
Donald Knuth's Selected Papers on Computer Science
http://tinyurl.com/5zraag
In it he has several great essays, one of which is:
Mathematics and Computer Science: Coping
10 matches
Mail list logo
