= 27d567bc2d48d9f40e9ccc20ea370b15)
Emile comments on Open Thread, August 2010-- part 2 - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (369)
Amusing exercise: find a complexity measure and a N such that "the Nth most complex hypothesis is always true" is the Nth most complex prior :)
:)
Equivalently, can you write a function that takes a string and returns true iff the string is the same as the source code of the function?
Anyone got some quining skills?
in Python:
...it's probably possible to make a simpler one.