Convergence of Expected Utilities with Algorithmic Probability Distributions

Details Convergence of Expected Utilities with Algorithmic Probability Distributions Convergence of Expected Utilities with Algorithmic Probability Distributions

2007-12-28

arxiv.org/abs/0712.4318v1

Computer Science

Artificial Intelligence

2 pages + title page, references

Scientific paper

We consider an agent interacting with an unknown environment. The environment is a function which maps natural numbers to natural numbers; the agent's set of hypotheses about the environment contains all such functions which are computable and compatible with a finite set of known input-output pairs, and the agent assigns a positive probability to each such hypothesis. We do not require that this probability distribution be computable, but it must be bounded below by a positive computable function. The agent has a utility function on outputs from the environment. We show that if this utility function is bounded below in absolute value by an unbounded computable function, then the expected utility of any input is undefined. This implies that a computable utility function will have convergent expected utilities iff that function is bounded.

Affiliated with

Also associated with

No associations

Rating

Convergence of Expected Utilities with Algorithmic Probability Distributions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Convergence of Expected Utilities with Algorithmic Probability Distributions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convergence of Expected Utilities with Algorithmic Probability Distributions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-508217