-6
\$\begingroup\$

Your job is to output the html of the current version (at the time of this writing) of the Wikipedia page for Kolmogorov complexity: https://en.wikipedia.org/w/index.php?title=Kolmogorov_complexity&oldid=781950121&action=raw (backup)

This is , so the shortest code wins.

\$\endgroup\$
5
  • 8
    \$\begingroup\$ I downvoted because I don't think this is an interesting challenge; there isn't much room for compression in my opinion. Other than maybe tags, not much can be done to compress it. \$\endgroup\$
    – hyper-neutrino
    Jun 12, 2017 at 13:23
  • \$\begingroup\$ @HyperNeutrino Well, you could encode the abstract concept of kolmogorov complexity, and then train a neural net on generating wikipedia articles, and then feed in the kolmogorov complexity concept. \$\endgroup\$
    – PyRulez
    Jun 12, 2017 at 13:27
  • \$\begingroup\$ I feel like that would be longer than just printing the text itself. \$\endgroup\$
    – hyper-neutrino
    Jun 12, 2017 at 14:10
  • 1
    \$\begingroup\$ related \$\endgroup\$
    – Arnauld
    Jun 12, 2017 at 15:19
  • 2
    \$\begingroup\$ You made a typo right in the title \$\endgroup\$
    – Mr. Xcoder
    Jun 12, 2017 at 15:32

2 Answers 2

3
\$\begingroup\$

7zip file manager: 12,156 bytes

hex dump: here

how to use:

7zip e [savedfileName]

I'm posting this because it's about as small as you can get it without using HTTP calls.

\$\endgroup\$
2
  • \$\begingroup\$ Is this valid seeing as it requires the use of an external file? \$\endgroup\$
    – Shaggy
    Jun 12, 2017 at 21:00
  • \$\begingroup\$ @Shaggy source code files aren't considered external. \$\endgroup\$
    – tuskiomi
    Jun 13, 2017 at 13:16
1
\$\begingroup\$

Bubblegum, 12,290 bytes

Hexdump of solution.

Try it online! (you have to paste the hexdump yourself, it's too long to fit in 30k chars)

\$\endgroup\$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.