Glen,
You say But, I'm not sure that having clues to where to look for discoverable
things is a reliable procedure. That sounds pretty ad hoc. If I were to
attempt to create a reliable procedure, it would invariably involve some
concerted (and distributed) hands-on effort to explore reality.
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:
[EMAIL PROTECTED] wrote:
It's odd that you don't catch my intent to help others understand a
very non ad hoc and efficient method, not yet in general use, for
doing just that. To understand my technique you do need to
distinguish between information and the physical prosesses from which
we
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
