Java programmer, theoretical computer science enthusiast

My blog

Oct
2
revised DB2 query error during the retrieval of a CLOB field
Added more information to the title and adjusting tags
Oct
2
awarded Popular Question
Oct
1
revised JPA QuerySyntaxException: Unable to locate appropriate constructor on class
added 474 characters in body
Oct
1
asked JPA QuerySyntaxException: Unable to locate appropriate constructor on class
Sep
30
awarded Explainer
Sep
30
awarded Explainer
Sep
30
awarded Explainer
Sep
16
awarded Yearling
Sep
16
awarded Yearling
Sep
15
comment Understanding the Sipser-Gacs-Lautemann theorem
@RickyDemer that's great, but I can't even understand the actual reasoning.
Sep
15
awarded Curious
Sep
14
answered A relationship in a UML class diagram
Sep
14
comment A relationship in a UML class diagram
A draft version of the original paper can be found here: alfa.di.uminho.pt/~jacome/down/ase14.pdf
Sep
14
revised Understanding the Sipser-Gacs-Lautemann theorem
added 161 characters in body
Sep
14
comment Understanding the Sipser-Gacs-Lautemann theorem
But I don't understand how and why. This is the reason why I posted my question here.
Sep
14
comment Understanding the Sipser-Gacs-Lautemann theorem
Thank you. What I don't understand is how the translations preserve the original random strings and how can a small set of strings cover all possible random strings.
Sep
14
comment Understanding the Sipser-Gacs-Lautemann theorem
@YuvalFilmus sorry, the previous form of my question contained many errors, I have corrected them and added information about the claims about binary strings.
Sep
14
revised Understanding the Sipser-Gacs-Lautemann theorem
added 382 characters in body
Sep
14
comment Understanding the Sipser-Gacs-Lautemann theorem
It seems strange to me that a formula that contains both $\exists$ and $\forall$ signs can describe NP. Usually NP is described by only $\exists$. Can you explain more how my formula describes NP?
Sep
14
asked Understanding the Sipser-Gacs-Lautemann theorem
1 2 3 4 5