Now that would be a cool extension of Axelrod’s test: include a penalty per round or per pairing as a function of algorithm length.
Length of source code, or running time? (How the heck did English end up with the same word for measuring time and a 3D axis?)
I had been thinking source code length, such that it would correspond to Kolmogorov complexity. Both would actually work, testing different things.
And perhaps the English question makes more sense if we consider things with a fourth time dimension ;)
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
Now that would be a cool extension of Axelrod’s test: include a penalty per round or per pairing as a function of algorithm length.
Length of source code, or running time? (How the heck did English end up with the same word for measuring time and a 3D axis?)
I had been thinking source code length, such that it would correspond to Kolmogorov complexity. Both would actually work, testing different things.
And perhaps the English question makes more sense if we consider things with a fourth time dimension ;)