Binary Search UDT
post by Joanna Morningstar (Jonathan_Lee) · 2015-07-19T06:19:57.000Z · LW · GW · 1 commentsThis is a link post for http://mathb.in/39392
1 comments
Comments sorted by top scores.
comment by orthonormal · 2015-07-26T16:54:35.000Z · LW(p) · GW(p)
This might combine well with the setup I thought of for studying bounded rationality / approximate utility maximizers. Namely, the setup is like that for UDT, but your algorithm has to pay 1 utilon for every call to its halting oracle. What algorithm might you use for this game?
(I find it easier to imagine that the algorithm is proving things only about the utility of the action not counting the computational costs.)