I just edited the above comment, because I had forgotten about Kolmogrov complexity, and in particular how K-complexity varies only by a constant between turing-complete machines. That link should explain it pretty well; now that I remembered this I’m significantly less convinced that the problem is isomorphic.
This is isomorphic to the problem (edit: not impossibility) of coming up with a fully mind-neutral definition of information entropy, is it not?
I am not familiar with it, feel free to link or explain...
I just edited the above comment, because I had forgotten about Kolmogrov complexity, and in particular how K-complexity varies only by a constant between turing-complete machines. That link should explain it pretty well; now that I remembered this I’m significantly less convinced that the problem is isomorphic.