5-and-10

Another version, sometimes known as the heavy ghost problem, raises a difficulty with certain types of UDT-UDT-like decision theories, when the fact that a counterfactual is known to be false makes the algorithm implement it.

The 5-and-10 problem addresses the question of how to construct a theory of logical counterfactuals.

Another version, sometimes known as the heavy ghost problem, is a problem in certain types of UDT-like decision theories, when the fact that a counterfactual is known to be false makes the algorithm implement it.

Let there be a decision problem which involves the choice between $5 and $10, a utility function that values the $10 more than the $5, and algorithm A optimizing for this utility function.

Another version, sometimes known as the heavy ghost problem, israises a problem indifficulty with certain types of UDT-like decision theories, when the fact that a counterfactual is known to be false makes the algorithm implement it.

Specifically, let there be a decision problem which involves the choice between $5 and $10, a utility function that values the $10 more than the $5, and anThe algorithm A that reasons something like:

References

• Two Major Obstacles for Logical Inductor Decision Theory by Scott Garrabrant

See also: Logical Uncertainty, Logical Induction

Let there be a decision problem which involves the choice between $5 and $10, a utility function that values the $10 more than the $5, and algorithm A optimizing for this utility function.

The 5-and-10 problem addresses the question of how to construct a theory of logical counterfactuals.counterfactuals.

The algorithm A that reasons something like:

• Two Major Obstacles for Logical Inductor Decision Theory by Scott Garrabrant

Another version,version, sometimes known as the heavy ghost problem, is a problem in certain types of UDT-like decision theories, when the fact that a counterfactual is known to be false makes the algorithm implement it.