Results from the 2022 Developer Survey are now available
Computer Science
user avatar
user avatar
user avatar
revisingcomplexity
  • Member for 8 years, 2 months
  • Last seen more than 4 years ago
Profile Activity
Stats
559
reputation
44k
reached
2
answers
23
questions
Communities
Badges
View all badges
1
gold badge
5
silver badges
18
bronze badges
Top tags
View all tags
1
Score
4
Posts
16
Posts %
1
Score
2
Posts
8
Posts %
1
Score
1
Posts
4
Posts %
1
Score
1
Posts
4
Posts %
0
Score
13
Posts
52
Posts %
0
Score
4
Posts
16
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
9
Halting problem reducing to the blank tape halting problem
Apr 11, 2015
question
5
Non-deterministic Turing machine to solve graph colouring
Apr 15, 2015
question
4
Can I encode a graph in a unary alphabet
Apr 29, 2015
question
3
Can a recursive language be uncountable?
Apr 29, 2015
question
3
Proving the set of finite languages is countable without using the union of countable sets
Apr 30, 2015
question
3
Is deciding whether the language of a TM contains all strings of length 4 computable?
Apr 27, 2015
question
3
Calculate Pagerank of three nodes
Apr 19, 2015
question
3
Why does SAT not reduce to QBF?
Apr 15, 2015
question
2
Understanding multi-variable big O (time complexity)
Sep 27, 2015
question
1
Definitions for Validity, Consistency, Integrity, Soundness and Completeness in Proof Systems
Apr 19, 2017

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.