You’re thinking of UDT which is a different thing. Read about UDASSA, it’s not a decision theory, it’s exactly what is described in Muller’s paper.
Does UDASSA include concepts like the “observer graph” and “graph machine” that Muller describes in the paper? Is Muller just filling out details that are inevitable once you have the core UDASSA concept?
I think these details are inevitable if you have UDASSA and want transition probabilities, but I don’t want transition probabilities :-)
Current theme: default
Less Wrong (text)
Less Wrong (link)
Arrow keys: Next/previous image
Escape or click: Hide zoomed image
Space bar: Reset image size & position
Scroll to zoom in/out
(When zoomed in, drag to pan; double-click to close)
Keys shown in yellow (e.g., ]) are accesskeys, and require a browser-specific modifier key (or keys).
]
Keys shown in grey (e.g., ?) do not require any modifier keys.
?
Esc
h
f
a
m
v
c
r
q
t
u
o
,
.
/
s
n
e
;
Enter
[
\
k
i
l
=
-
0
′
1
2
3
4
5
6
7
8
9
→
↓
←
↑
Space
x
z
`
g
You’re thinking of UDT which is a different thing. Read about UDASSA, it’s not a decision theory, it’s exactly what is described in Muller’s paper.
Does UDASSA include concepts like the “observer graph” and “graph machine” that Muller describes in the paper? Is Muller just filling out details that are inevitable once you have the core UDASSA concept?
I think these details are inevitable if you have UDASSA and want transition probabilities, but I don’t want transition probabilities :-)