Computer Science
Maczinga's user avatar
Maczinga's user avatar
Maczinga's user avatar
Maczinga
  • Member for 6 years, 9 months
  • Last seen more than 1 year ago
Profile Activity
Stats
460
reputation
18k
reached
15
answers
0
questions
Communities
View all
About

Please look at my website if you are curious ;-)

Badges
View all badges
This user doesn’t have any gold badges yet.
2
silver badges
8
bronze badges
Top tags
View all tags
10
Score
3
Posts
20
Posts %
8
Score
3
Posts
20
Posts %
7
Score
2
Posts
13
Posts %
5
Score
2
Posts
13
Posts %
3
Score
2
Posts
13
Posts %
3
Score
2
Posts
13
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
4
Is Post's Problem undecidable for fixed number of tiles i.e. $n\geq5$
Mar 13, 2017
answer
3
Is it always enough to prove that a subset $L'$ of a language $L$ is unprovable in order to prove that $L$ is undecidable?
Feb 27, 2017
answer
3
How to create new language with languages $L_a = \{a\}, L_b = \{b\}$ and set operations?
Mar 5, 2017
answer
3
Lemma 2 in Knuth's "Notes on Open Addressing"
Mar 18, 2017
answer
2
In the Resolution equivalence ($\neg A \implies B, B \implies C \models \neg A \implies C$) must $A$ be negated?
Feb 26, 2017
answer
2
Error solving the next recurrence: $T(n)=7T(n/2)+n^2$
Feb 26, 2017
answer
2
Show that if Automata $A$ recognize language $L$, there also exists an automata $A′$ that recognize $Double(L)$
Feb 27, 2017
answer
2
Pumping Lemma: Proving L={0^n 1^m |m ≤n^2} is not a CFL
Mar 4, 2017
answer
1
What is the simplification of AB + BC + (~B)C?
Feb 26, 2017
answer
1
Is the language $\{a^nb^{2^n}|n\geq 0\}$ Turing recognizable/decidable?
Mar 1, 2017
Top network posts
View all network posts
41
Is an erratum justified for a weak result?
10
Meaning of Infinite Union/Intersection of sets
6
Normal Covering of a Space

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.