I started to write "algorithmic complexity", but then thought it
could easily be misinterpreted as referring to the (run-time)
complexity of a particular algorithm.
In algorithmic complexity theory, the issue is not how much time or
space a given algorithm requires to run, but how complex an algorithm
is required to describe a given set. To make things more concrete,
consider the problem of printing out even numbers, and compare it to
the problem of printing out those n for which 2^n + 1 is NOT prime.
===
Gregory Woodhouse
[EMAIL PROTECTED]
"Before one gets the right answer, one must ask the right question."
-- S. Barry Cooper
On Aug 15, 2005, at 8:40 AM, Mike Lieman wrote:
On 8/15/05, Gregory Woodhouse <[EMAIL PROTECTED]> wrote:
He didn't make it explicit, but I believe the the "compression"
that the
author of these slides had in mind was related to Kolmogorov
complexity.
Don't you go bringing THAT into this conversation. I was at a hippie
music festival once, and this, um, Overindulger asks "What *is*
reality all about?" Without a second's hesitation I say "Algorithmic
Compressablility".
I guess you had to be there.
-------------------------------------------------------
SF.Net email is Sponsored by the Better Software Conference & EXPO
September 19-22, 2005 * San Francisco, CA * Development Lifecycle Practices
Agile & Plan-Driven Development * Managing Projects & Teams * Testing & QA
Security * Process Improvement & Measurement * http://www.sqe.com/bsce5sf
_______________________________________________
Hardhats-members mailing list
Hardhats-members@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/hardhats-members
