= 27d567bc2d48d9f40e9ccc20ea370b15)
Peter_de_Blanc comments on Another attempt to explain UDT - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (50)
Eliezer has expressed the idea that using a Solomonoff-type prior over all programs doesn't mean you believe the universe to be computable - it just means you're trying to outperform all other (ETA: strike the word "other") computable agents. This position took me a lot of time to parse, but now I consider it completely correct. Unfortunately the reason it's correct is not easy to express in words, it's just some sort of free-floating math idea in my head.
Not sure how exactly this position meshes with UDT, though.
Why do you say "all other computable agents"? Solomonoff induction is not computable.
Right, sorry. My brain must've had a hiccup. It's scary how much this happens. Amended the comment.