Answers.Body: <p>Matt Mahoney is one of the organizers of the <a href="http://prize.hutter1.net/" rel="nofollow noreferrer">Prize for Compressing Human Knowledge</a> (Hutter prize), with Jim Bowery and Marcus Hutter. The prize is awarded to progress in compressing 1GB of Wikipedia text, so let us try to work out an example from it.</p>
  <p>We read in the Wikipedia that Marcus Hutter was born &quot;April 14, 1967&quot;. From our prior knowledge of the world (or reading the Wikipedia!), we know there are <span class="math-container">$12$</span> months per year, up to <span class="math-container">$31$</span> days per month and we are in <span class="math-container">$2022$</span> now, luckily close to <span class="math-container">$2048$</span>. Therefore, we can safely use <span class="math-container">$4$</span> bits for the month (<span class="math-container">$2^4&gt;12$</span>), <span class="math-container">$5$</span> for the day (<span class="math-container">$2^5&gt;31$</span>) and <span class="math-container">$11$</span> for the year (<span class="math-container">$2^{11}&gt;2022$</span>), totalling <span class="math-container">$20$</span> bits for a lossless compression of a birth date (CE).</p>
  <p>The original string &quot;April 14, 1967&quot; is <span class="math-container">$14$</span> characters long, so <span class="math-container">$112$</span> bits assuming <span class="math-container">$8$</span> bits/character.</p>
  <p>Thus some understanding of this tiny bit of information gets a <span class="math-container">$\frac{112}{20}$</span> compression factor, about <span class="math-container">$5.6$</span>. Maybe the comparison makes little sense here, but <span class="math-container">$5.6$</span> is similar to the initial <span class="math-container">$5.46$</span> compression factor by Matt Mahoney. Of course there are a lot of much more complex information structures in the Wikipedia. Besides, the month length can go up and down some characters, so this sample value is far from a constant for all dates.</p>
  <p>Anyway, hopefully this simple example shows some relationship between text compression and understanding.</p>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2022-12-13T15:44:13.780Z
Answers.LastActivityDate: 2022-12-13T17:12:37.037Z
Answers.LastEditDate: 2022-12-13T17:12:37.037Z
Answers.UserDisplayName: Jaume Oliver Lafont
Answers.Body: <p>The paper suggests an <strong>alternative test</strong> to the famous <a href="https://en.wikipedia.org/wiki/Turing_test" rel="nofollow noreferrer">Turing test</a>, which tests a machine's ability to exhibit intelligent behavior equivalent to, or indistinguishable from, that of a human.</p>
  <p>In this test, if winRar or 7zip will compress a file similarly to how a human would compress a file (how does a human compress a file?!), then, yes, those programs will pass the test and will be considered intelligent.</p>
  <blockquote>
  <p>... thus compression ratio on a standard benchmark corpus could be used as an objective and quantitative alternative test for AI (Mahoney, 1999).</p>
  </blockquote>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2021-03-22T14:22:30.187Z
Answers.Text: How does the paper think that the way a human compresses some information (in form of summary or something) and the way a computer program does (through Huffman coding or frequency tables) are compatible?
Answers.UserDisplayName: Aether
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2021-03-24T14:24:44.847Z
Answers.Text: I have no idea.  I think that your question is valid and the paper does not answer it.
Answers.UserDisplayName: Cohensius
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2021-03-22T14:14:56.567Z
Answers.LastActivityDate: 2021-03-22T14:25:33.237Z
Answers.LastEditDate: 2021-03-22T14:25:33.237Z
Answers.UserDisplayName: Cohensius
Body: <p>I read this paper <a href="https://www.aaai.org/Papers/AAAI/1999/AAAI99-177.pdf" rel="nofollow noreferrer">Text Compression as a Test for Artificial Intelligence, Mahoney, 1999</a>.</p>
  <p><strong>So far I understood the following:</strong>
  Text Compression tests can be used as an alternative to Turing Tests for intelligence.
  The <em>Bits per character</em> score obtained from compression of a standard benchmark corpus, can be used as a quantitative measure for intelligence</p>
  <p><strong>My questions:</strong></p>
  <ol>
  <li>Is my understanding of the topic correct?</li>
  <li>Does this mean that applications like 7zip/WinRar are intelligent?</li>
  <li>How are the ways a human compresses information (as in form of summary) and ways a computer compresses (using Huffman coding or something) are compatible? How can we compare that?</li>
  </ol>
  
Tags: <intelligent-agent><intelligence-testing><data-compression>
Title: Do text compression tests qualify winRar or 7zip as intelligent?
UserDisplayName: Aether
ThreadText: # Do text compression tests qualify winRar or 7zip as intelligent?
  
  (Asked by: username_0 on 2021-03-22)
  
  I read this paper [Text Compression as a Test for Artificial Intelligence, Mahoney, 1999](https://www.aaai.org/Papers/AAAI/1999/AAAI99-177.pdf).
  
  **So far I understood the following:**
  Text Compression tests can be used as an alternative to Turing Tests for intelligence.
  The *Bits per character* score obtained from compression of a standard benchmark corpus, can be used as a quantitative measure for intelligence
  
  **My questions:**
  
  1. Is my understanding of the topic correct?
  2. Does this mean that applications like 7zip/WinRar are intelligent?
  3. How are the ways a human compresses information (as in form of summary) and ways a computer compresses (using Huffman coding or something) are compatible? How can we compare that?
  
  **Tags:** intelligent-agent, intelligence-testing, data-compression
  
  
  ---
  
  ## 2 answers
  
  ### Answer by username_1 on 2022-12-13. Score: 1
  
  Matt Mahoney is one of the organizers of the [Prize for Compressing Human Knowledge](http://prize.hutter1.net/) (Hutter prize), with Jim Bowery and Marcus Hutter. The prize is awarded to progress in compressing 1GB of Wikipedia text, so let us try to work out an example from it.
  
  We read in the Wikipedia that Marcus Hutter was born "April 14, 1967". From our prior knowledge of the world (or reading the Wikipedia!), we know there are $12$ months per year, up to $31$ days per month and we are in $2022$ now, luckily close to $2048$. Therefore, we can safely use $4$ bits for the month ($2^4>12$), $5$ for the day ($2^5>31$) and $11$ for the year ($2^{11}>2022$), totalling $20$ bits for a lossless compression of a birth date (CE).
  
  The original string "April 14, 1967" is $14$ characters long, so $112$ bits assuming $8$ bits/character.
  
  Thus some understanding of this tiny bit of information gets a $\frac{112}{20}$ compression factor, about $5.6$. Maybe the comparison makes little sense here, but $5.6$ is similar to the initial $5.46$ compression factor by Matt Mahoney. Of course there are a lot of much more complex information structures in the Wikipedia. Besides, the month length can go up and down some characters, so this sample value is far from a constant for all dates.
  
  Anyway, hopefully this simple example shows some relationship between text compression and understanding.
  
  
  ---
  
  ### Answer by username_2 on 2021-03-22. Score: 1
  
  The paper suggests an **alternative test** to the famous [Turing test](https://en.wikipedia.org/wiki/Turing_test), which tests a machine's ability to exhibit intelligent behavior equivalent to, or indistinguishable from, that of a human.
  
  In this test, if winRar or 7zip will compress a file similarly to how a human would compress a file (how does a human compress a file?!), then, yes, those programs will pass the test and will be considered intelligent.
  
  > ... thus compression ratio on a standard benchmark corpus could be used as an objective and quantitative alternative test for AI (Mahoney, 1999).
  
  > **Comments:**
  > **username_0**: How does the paper think that the way a human compresses some information (in form of summary or something) and the way a computer program does (through Huffman coding or frequency tables) are compatible?  
  > **username_2**: I have no idea.  I think that your question is valid and the paper does not answer it.  
  
  ---
  
  