Here, I present a failed attempt to build an updateless decision theory out of universal inductors. It fails because it is is mistaking updatelessness about which logical theory it is in for true logical updatelessness about computations. I will use Tsvi's notation.
Fix a UGI, . Fix a sequence of utility functions , which assigns a utility to all propositionally consistent worlds (represented by infinite bit strings). We assume that is computable function of and the first bits for some computable function . In the simplest example, is just equal to a single bit in the string.
We define a sequence of agents which output a single bit or . These agents will be broken into two pieces, a deductive process, which outputs a bunch of logical facts, and a decision process, which chooses a policy in the form of a function from the possible outputs of the deductive process to .
Let denote the set of policies that the decision process can output. There is a computable partition of worlds into sets of worlds where each policy is output, . For each , we can compute the expectation, , where W is sampled according to . The decision process outputs the policy which maximizes , and the agent outputs the result of applying that policy to the output of the deductive process.
There are actually many things wrong with the above proposal, and many similar proposals that fail in similar or different ways. However, I want to focus on the one problem that proposals like this have in common:
Universal Induction is a model for uncertainty about what theory/model you are in; it is not a model for uncertainty about the output of computations.
It is easiest to see why this is a problem using the counterfactual mugging problem. We would like to use a universal inductor to be uncertain about a digit of , and thus reason about the world in which it went another way. The problem is that a powerful universal inductor has the digits of in its probabilities, even if it does not know that it is in PA. This is because the Kolomorogov complexity of a infinite string of the digits of is very low, while the Kolomorogov complexity of a string that looks like for a very long time, and then changes is high. We do not have to direct our UGI at PA for it to have good beliefs about late bits in a string that starts out looking like .
I will use the phrase "logical updatelessness" to refer updatelessness about computations. I think updatelessness about the logical system is mostly a distraction from the more important concept of logical updatelessness. (Similarly, I believe that early work in logical uncertainty about distributions over complete theories was mostly a distraction from the later work that focused on uncertainty about computations.)