Suppose I claim that text8.zip available at http://cs.fit.edu/~mmahoney/compression/textdata.html is in canonical form.
I reject your nonsensical
claim.
If you claim that this is not in canonical form, then prove it.
Specify a criteria for canonical form, a pass/fail
test.
By
Mark, I didn't get your attachment, the program that tells me if an arbitrary text string is in canonical form or not. Actually, if it will make it any easier, I really only need to know if a string is a canonical representation of Wikipedia.Oh, wait... there can only be one canonical form. I
Matt Mahoney wrote:
Mark, I didn't get your attachment, the program that tells me if an
arbitrary text string is in canonical form or not. Actually, if it
will make it any easier, I really only need to know if a string is a
canonical representation of Wikipedia.
Oh, wait... there can only
On 8/25/06, Matt Mahoney [EMAIL PROTECTED] wrote:
As I stated earlier, the fact that there is normal variation in human language
models makes it easier for a machine to pass the Turing test. However, a
machine with a lossless model will still outperform one with a lossy model
because the
In showing that compression implies AI, I first make the simplifying assumption
that everyone shares the same language model. Then I relax that assumption and
argue that this makes it easier for a machine to pass the Turing test.
But I see your point. I argued that a lossless model knows
