Pascal's Mugging: Tiny Probabilities of Vast Utilities — LessWrong
lesswrong.com · 20,571 words · saved by 1 readers
The most common formalizations of Occam's Razor, Solomonoff induction and Minimum Description Length, measure the program size of a computation used…
x Pascal's Mugging: Tiny Probabilities of Vast Utilities — LessWrong Pascal's Mugging Infinities In Ethics Solomonoff induction Decision theory Paradoxes Utility Functions Frontpage 125 Pascal's Mugging: Tiny Probabilities of Vast Utilities by Eliezer Yudkowsky 19th Oct 2007 5 min read 355 125 The most common formalizations of Occam's Razor , Solomonoff induction and Minimum Description Length, measure the program size of a computation used in a hypothesis, but don't measure the running time or space requirements of the computation. What if this makes a mind vulnerable to finite forms of Pasca
saved by
related reading
- The Lifespan Dilemma — LessWronglesswrong.com
- Bayesian Mindsetcold-takes.com
- Pascal's mugging - Wikipediaen.wikipedia.org
- Something to Protect — LessWronglesswrong.com
- Solomonoff's theory of inductive inference - Wikipediaen.wikipedia.org
- An Intuitive Explanation of Solomonoff Induction — LessWronglesswrong.com
- Probabilities are not the right concept — LessWronglesswrong.com
- Pascal's Muggingnickbostrom.com
- Interpretations of Probability (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- The Solomonoff Prior is Malign — LessWronglesswrong.com
- Why We Can't Take Expected Value Estimates Literally (Even When They're Unbiased) — LessWronglesswrong.com
- A Semitechnical Introductory Dialogue on Solomonoff Induction — AI Alignment Forumalignmentforum.org