You're looking at Less Wrong's discussion board. This includes all posts, including those that haven't been promoted to the front page yet. For more information, see About Less Wrong.

solipsist comments on Does the Utility Function Halt? - Less Wrong Discussion

3 Post author: OrphanWilde 28 January 2015 04:08AM

You are viewing a comment permalink. View the original post to see all comments and the full post content.

Comments (9)

You are viewing a single comment's thread.

Comment author: solipsist 28 January 2015 03:22:53PM *  3 points [-]

If the set of Universe States is finite, then yes, there will be a computable utility function for any VNM-rational preferences (the program can be just a lookup table).

If the set of possible Universe States is countably infinite, and you can meaningfully encode every universe state as a finite string, then no, not every utility function is computable. Counterexample: number the possible universes and assign a utility of $1 to every universe whose number describes a halting turing machine, and $0 for every universe whose number describes a non-halting turing machine.

If the set of possible Universe States is uncountably infinite, or you cannot meaningfully encode every universe state as a finite string, then no, the utility functions might not be remotely computable.

What does Morality Modeling Language do? If you allow it to describe only computable utility functions, then you can make it describe only computable utility functions!

Comment author: solipsist 28 January 2015 09:59:07PM 2 points [-]

If the set of Universe States is finite, then yes, there will be a computable utility function for any VNM-rational preferences (the program can be just a lookup table).

Ooops, not totally correct, because the probabilities in the lotteries could be uncomputable.