Theoretical Computer Science
Mike B.'s user avatar
Mike B.'s user avatar
Mike B.'s user avatar
Mike B.
  • Member for 12 years, 1 month
  • Last seen more than 4 years ago
Profile Activity
Stats
749
reputation
21k
reached
4
answers
3
questions
Communities
View all
About

I was, am, and always will be... a student, not amazed by what he knows, but by what he still has to learn.

Badges
View all badges
This user doesn’t have any gold badges yet.
5
silver badges
13
bronze badges
Top tags
View all tags
4
Score
2
Posts
29
Posts %
4
Score
2
Posts
29
Posts %
4
Score
1
Posts
14
Posts %
4
Score
1
Posts
14
Posts %
3
Score
2
Posts
29
Posts %
3
Score
1
Posts
14
Posts %
Top posts
All Questions Answers
Score Newest
question
29
Conditions for NFA universality
Dec 3, 2010
question
19
(False?) proof for computability of a function?
Oct 6, 2010
answer
4
Matching regular expressions using regular expressions
Oct 13, 2011
answer
4
A "simple" language outside $CFL \cup coCFL$?
Nov 24, 2011
answer
3
What is the k-SAT problem?
Sep 12, 2010
answer
3
Repeated Quine program
Oct 1, 2010
question
1
Succinct representation of boolean functions
Oct 29, 2011
Top network posts
View all network posts
19
Intersection and union of a regular and a non-regular language
13
Are Turing machines more powerful than pushdown automata?
8
Complete Problems for $DSPACE(\log(n)^k)$
8
Is it $\mathsf{NP}$-hard to decide whether $\mathsf{P}=\mathsf{NP}$?
6
Proving NP is a subset of the union of exponential DTIME

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.