{"id":2176,"date":"2019-04-07T21:50:23","date_gmt":"2019-04-08T05:50:23","guid":{"rendered":"http:\/\/antoine.wojdyla.fr\/blog\/?p=2176"},"modified":"2019-06-10T23:23:46","modified_gmt":"2019-06-11T07:23:46","slug":"kolmogorov-access","status":"publish","type":"post","link":"http:\/\/antoine.wojdyla.fr\/blog\/2019\/04\/07\/kolmogorov-access\/","title":{"rendered":"Kolmogorov Access"},"content":{"rendered":"

Back in undergrad, I remember being fascinated by the notion of Kolmogorov complexity<\/a> in computer science.<\/p>Put simply, the Kolmogorov complexity is the minimal length (number of lines) of the code needed to generate a signal, would it be a mathematical sequence (such as one listed in the OEIS<\/a>) or an image, irrespective to the size needed to store it. It bears deep relations with the notion of entropy (a great book on the topic is Information Theory, Inference, and Learning Algorithms<\/a> by the late David MacKay.)<\/p>For example, a series of eight billion ones in a row would require 1GB of memory, but can be written in a few lines of code:<\/p>\n

for i in 1:1e9; print 1; end<\/p>(To some extent, this is why computer science is often problematic, since one of the goal of a good code is sometimes to reduce its Kolmogorov complexity, but the final code does not show all the lines that have been erased to get there…)<\/p>In the field of arts, culture and science, this description seems naive: can you really generate a book based on a script, or has it infinite entropy?<\/p>\n

Science is organized knowledge. Wisdom is organized life.
\n– Immanuel Kant<\/p><\/blockquote>

\"\"<\/a><\/p>In the age of the Internet, can we do better?<\/p>update 6\/10\/2019:<\/em> I’ve seen recently on Twitter the embodiment of these ideas, see Nicole R.<\/a>‘s thread. Way to go!<\/p><\/p>\n

URLs and Link shorteners<\/h3>\n

Digital Object Identifiers<\/h3>\n

Twitter<\/h3>

I believe Twitter is actually an excellent way to link information: it has identifiable information, a short link and the data.<\/p>\n","protected":false},"excerpt":{"rendered":"

Back in undergrad, I remember being fascinated by the notion of Kolmogorov complexity in computer science.Put simply, the Kolmogorov complexity is the minimal length (number of lines) of the code needed to generate a signal, would it be a mathematical sequence (such as one listed in the OEIS) or an image, irrespective to the size […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[11,13,14,16,5],"tags":[],"class_list":["post-2176","post","type-post","status-publish","format-standard","hentry","category-english","category-epistemology","category-projects","category-resources","category-science-life"],"_links":{"self":[{"href":"http:\/\/antoine.wojdyla.fr\/blog\/wp-json\/wp\/v2\/posts\/2176","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/antoine.wojdyla.fr\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/antoine.wojdyla.fr\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/antoine.wojdyla.fr\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/antoine.wojdyla.fr\/blog\/wp-json\/wp\/v2\/comments?post=2176"}],"version-history":[{"count":5,"href":"http:\/\/antoine.wojdyla.fr\/blog\/wp-json\/wp\/v2\/posts\/2176\/revisions"}],"predecessor-version":[{"id":2240,"href":"http:\/\/antoine.wojdyla.fr\/blog\/wp-json\/wp\/v2\/posts\/2176\/revisions\/2240"}],"wp:attachment":[{"href":"http:\/\/antoine.wojdyla.fr\/blog\/wp-json\/wp\/v2\/media?parent=2176"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/antoine.wojdyla.fr\/blog\/wp-json\/wp\/v2\/categories?post=2176"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/antoine.wojdyla.fr\/blog\/wp-json\/wp\/v2\/tags?post=2176"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}