like infinite state Turing machines, or something like this:https://arxiv.org/abs/1806.08747
like infinite state Turing machines, or something like this:
https://arxiv.org/abs/1806.08747
Interesting, I’ll check it out!
Note that it isn’t intended to be in any way a realistic program we could ever run, but rather an interesting ideal case where we could compute every well-founded set.
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
Interesting, I’ll check it out!
Note that it isn’t intended to be in any way a realistic program we could ever run, but rather an interesting ideal case where we could compute every well-founded set.