Theoretical Computer Science
Bjørn Kjos-Hanssen
Moderator
Profile Activity
Stats
4,318
reputation
36k
reached
70
answers
3
questions
Communities
View all
About
Badges
View all badges
2
gold badges
22
silver badges
37
bronze badges
Top tags
View all tags
148
Score
21
Posts
29
Posts %
67
Score
10
Posts
14
Posts %
64
Score
17
Posts
23
Posts %
56
Score
11
Posts
15
Posts %
19
Score
4
Posts
5
Posts %
13
Score
7
Posts
10
Posts %
Top posts
View all questions and answers
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
20
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
Function that is guaranteed to be one-way if one-way functions exist?
Sep 15 '18
12
Is there a useful notion of being “approximately computable”
Aug 23 '18
11
Example of something that’s different for generic and random oracles?
Sep 11 '17
11
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
Top Meta posts
5
10
16
A decade of CSTheory
5
Let's get MathOverflow's “Citation Helper” here, as well!
5
Help vote on answers to good questions
5
Lemons and lemonade
4
The big question: does P=NP?
Top network posts
View all network posts
71
Do you need to read a whole article before citing it?
51
When mentioning the author of a journal I am using in my Literature Review, should I mention author's credentials?
51
Is there a measure zero set which isn't meagre?
47
Do any two spanning trees of a simple graph always have some common edges?
41
Suggestions for good notation

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.