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:
lambda s : (lambda src, s : (src.replace("CO"+"DE", src) == s))("lambda s : (lambda src, s : (src.replace(\"CO\"+\"DE\", src) == s))(\"CODE\", s)", s)
...it’s probably possible to make a simpler one.
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.