kolmogorov-complexity is one of the tags on this site, representing challenges that test how much code is needed to output a given fixed result (usually a piece of text). The info page for this tag lists the string
4c1j5b2p0cv4w1x8rx2y39umgw5q85s7uraqbjfd as an example of a string with a high Kolmogorov complexity, stating that printing this string literally is probably the shortest way to output it. I would like to test this statement, and thus your challenge is to output this string, without using a literal representation of it.
- You must write a full program that takes no input, and outputs exactly the result string, with a single optional trailing newline. Output may be in any format allowed by default IO rules (writing to STDOUT, writing to a file, displaying to the screen, etc)
- No submitting the trivial solution of your language's equivalent of
print "4c1j5b2p0cv4w1x8rx2y39umgw5q85s7uraqbjfd", however, I will create a community wiki answer to list trivial solutions for comparison, so if you answer in a language not added to that answer, please edit that language's trivial solution (if it exists) into that post.
- Use of built-ins is allowed, if your language somehow has a built-in that contains or can easily generate this string, I would love to see that.
code-golf, so lowest bytecount is best score, but please also list the difference in length between your bytecount and the bytecount of your language's trivial solution with your score.
print "4c1j5b2p0cv4w1x8rx2y"+"39umgw5q85s7uraqbjfd"different enough to not be a trivial solution? Given that the string is chosen to have a high Kolmogorov complexity, I doubt it has any significant patterns that can be exploited, so every solution is likely to be some variation on hard-coding the string. \$\endgroup\$