Theoretical Computer Science
Russell Easterly
  • Member for 10 years, 7 months
  • Last seen more than 1 year ago
Profile Activity
Stats
501
reputation
3k
reached
4
answers
6
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
2
silver badges
9
bronze badges
Top tags
View all tags
2
Score
3
Posts
30
Posts %
2
Score
2
Posts
20
Posts %
2
Score
1
Posts
10
Posts %
0
Score
4
Posts
40
Posts %
0
Score
3
Posts
30
Posts %
0
Score
3
Posts
30
Posts %
Top posts
All Questions Answers Articles
Votes Newest
14
Comparing the Kolmogorov complexity of theories
Feb 3 '15
9
MAX 1 in 2 SAT Algorithm
Aug 22 '14
6
Comparing the Kolmogorov complexity of theories - Part 2
Feb 24 '15
6
What is the Kolmogorov complexity of arithmetic?
May 5 '15
3
Independent Sets that are Odd Covers
May 20 '14
2
How hard is counting the number of vertex covers after a small perturbation?
Apr 28 '11
0
Weighted SAT: is this a known problem?
Jul 15 '13
-2
Complexity of applying a permutation in-place
May 24 '11
-2
Complexity of applying a permutation in-place
May 26 '11
-3
Are nearly all natural numbers compressible? [closed]
Aug 17 '15
Top network posts
View all network posts
28
Even XOR Odd Infinities?
11
Can A Decidable Theory Have Nonrecursive Models?
10
What is wrong with this simple proof of P=NP?
9
How does induction fail in computable nonstandard models?
8
Is there a natural bijection from $\mathbb{N}$ to $\mathbb{Q}$?

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.