Last call to make your voice heard! Our 2022 Developer Survey closes in less than a week. Take survey.
Theoretical Computer Science
user avatar
user avatar
user avatar
Russell Easterly
  • Member for 11 years, 1 month
  • Last seen this week
Profile Activity
Stats
499
reputation
3k
reached
4
answers
7
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
27
Posts %
2
Score
2
Posts
18
Posts %
2
Score
2
Posts
18
Posts %
0
Score
4
Posts
36
Posts %
0
Score
4
Posts
36
Posts %
0
Score
3
Posts
27
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
13
Comparing the Kolmogorov complexity of theories
Feb 3, 2015
question
9
MAX 1 in 2 SAT Algorithm
Aug 22, 2014
question
6
Comparing the Kolmogorov complexity of theories - Part 2
Feb 24, 2015
question
6
What is the Kolmogorov complexity of arithmetic?
May 5, 2015
question
3
Independent Sets that are Odd Covers
May 20, 2014
answer
2
How hard is counting the number of vertex covers after a small perturbation?
Apr 28, 2011
question
0
Short UNSAT Certificates for X3SAT
May 18
answer
0
Weighted SAT: is this a known problem?
Jul 15, 2013
answer
-2
Complexity of applying a permutation in-place
May 24, 2011
answer
-2
Complexity of applying a permutation in-place
May 26, 2011
Top network posts
View all network posts
29
Even XOR Odd Infinities?
10
How does induction fail in computable nonstandard models?
10
What is wrong with this simple proof of P=NP?
9
Can A Decidable Theory Have Nonrecursive 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.