Databases
StackOverflow2013
Postsdbo
POKolmogorov Complexity Approximation Algorithm
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POKolmogorov Complexity Approximation Algorithm
    primarykey
    data
    text
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USCœur
    1. USTony
    plurals
    1. PL
      singulars
      1. LTLinked
    2. PL
      singulars
      1. LTLinked
    3. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POKolmogorov Complexity Approximation Algorithm
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POKolmogorov Complexity Approximation Algorithm
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POKolmogorov Complexity Approximation Algorithm
      1. This table or related slice is empty.
      1. VTUpMod
    1. COFor those unfamiliar with the topic, the Kolmogorov complexity of a string is, in essence, "the length of the shortest program that generates the string". For instance, a 9x9 multiplication table can be produced in 8 characters ( `*/~1+i.9` ) with the J programming language ( [see here](http://stackoverflow.com/questions/3412730/code-golf-output-multiplication-table-to-the-console) ). From this, you could say that a 9x9 multiplication table has a Kolmogorov complexity of 8 or less with respect to the J programming language.
      singulars
      1. POKolmogorov Complexity Approximation Algorithm
      1. USJoey Adams
    2. COIf you are trying to proof something formally, you'll have to write your proof independently of (completely disregarding) the method used to approximate it. If you're just looking for fun, how about try a data compression algorithm?
      singulars
      1. POKolmogorov Complexity Approximation Algorithm
      1. USrwong
    3. CONo, I'm not looking for a proof. I'm looking for an algorithim that satisfies the above stated properties. I haven't been able to find one, and I wanted to know if anybody has done it already. I don't know of any Data compression algorithims that can in principal find the exact Kolmogorov Complexity given enough time. I suppose at first glance since you are always working with finite strings an enumeration search of all possible Turing machines might work... But the problem might be undecidable. I'm looking for an algorithim like this for machine learning applications.
      singulars
      1. POKolmogorov Complexity Approximation Algorithm
      1. USTony
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload