OP measures the system’s ability to achieve its goals, not how hard these goals are.
Not really. It’s often largely a measure of how big the specified solution space is—e.g.:
What’s the smallest prime larger than a million, and smaller than a billion?
What’s the smallest prime larger than a million, and smaller than a trillion?
Essentially the same problem, bigger solution space—more EOP [Eliezer Optimization Power].
Thanks, have updated the text with a variant of that problem.
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
Not really. It’s often largely a measure of how big the specified solution space is—e.g.:
What’s the smallest prime larger than a million, and smaller than a billion?
What’s the smallest prime larger than a million, and smaller than a trillion?
Essentially the same problem, bigger solution space—more EOP [Eliezer Optimization Power].
Thanks, have updated the text with a variant of that problem.