We’re rewarding the question askers & reputations are being recalculated! Read more.
Theoretical Computer Science
Meta user
Network profile
3,988
reputation
2
21
37

Bjørn Kjos-Hanssen♦
Moderator

66
answers
3
questions
~30k
people reached

Communities (60)

Top Meta Posts
4
9

Top network posts

Top tags (86)

Score 146
Posts 21
Posts % 30
Score 67
Posts 10
Score 64
Posts 17
Score 54
Posts 10
Score 19
Posts 4
Score 11
Posts 4
View all tags →

Top posts (69) All Questions Answers | Votes Newest

31 Are there any proofs the undecidability of the halting problem that does not depend on self-referencing or diagonalization ? Nov 10 '10
19 Weighted Hamming distance Nov 2 '10
18 Is there algorithmic mathematical analysis? May 30 '15
15 The TOC Blog Aggregator is Offline Nov 18 '18
12 Is there a useful notion of being “approximately computable” Aug 23 '18
11 Function that is guaranteed to be one-way if one-way functions exist? Sep 15 '18
10 Example of something that’s different for generic and random oracles? Sep 11 '17
10 Is predicting (in the limit) computable sequences as hard as the halting problem? Nov 12 '10
10 Proof of undecidability not by reduction from the halting problem Apr 4 '14
9 Non-comparable natural numbers Aug 15 '18
View all questions and answers →

Badges (60)

Gold

2

Rarest

Silver

21

Rarest

Bronze

37

Rarest

View all badges →