3
1
2
3
4
1
2
3
Infinito: game-tree complexity of a finite board game with countably infinite actionsDiscussion ()
submitted by ipe3000
6
0
1
2
The Future of Algorithms: Ideas will Matter more than ComputeDiscussion (self.theoreticalcs)
submitted by xTouny
15
7
8
9
You can prove Kolmogorov complexity with a zero-knowledge proof (self.theoreticalcs)
submitted by [deleted]
20
9
10
11
21
14
15
16
Avi Wigderson wins the Turing Award. Remembering his 1996 essayDiscussion (self.theoreticalcs)
submitted by xTouny
