# 5-and-10

 Ruby v1.12.0Sep 12th 2020 (+48) Ruby v1.11.0Sep 12th 2020 (-20) Ruby v1.10.0Sep 12th 2020 (+4/-4) Ruby v1.9.0Sep 12th 2020 (+17/-16) Import fix-up, fix lack of indentation with quote boxes. Add in some links to counterfactual tag and Scott's user page. Caspar42 v1.8.0Sep 28th 2017 (+86) JoshuaFox v1.7.0Mar 8th 2016 (-5) JoshuaFox v1.6.0Mar 8th 2016 (+212/-167) JoshuaFox v1.5.0Mar 8th 2016 (+108) JoshuaFox v1.4.0Mar 8th 2016 (+8/-16) JoshuaFox v1.3.0Mar 8th 2016 (+276/-31) two verssions

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, 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.counterfactuals.

## References

The algorithm A that reasons something like:

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:

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.

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.

The five-One version of the 5-and-ten10 problem (sometimes is "I have to decide between \$5 and \$10. Suppose I decide to choose \$5. I know that I'm a money-optimizer, so if I do this, \$5 must be more money than \$10, so this alternative is better. Therefore, I should choose \$5."

Another version, sometimes known as the heavy ghost problem)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.