Computer Science
Vor
Profile Activity
Stats
12,013
reputation
506k
reached
176
answers
33
questions
About

Basically I'm a programmer :-)
I enjoy reading papers about the complexity of puzzle games, and I'm writing (amateur) proofs on the complexity of a few puzzle games.

My blog on Computational Complexity, Puzzles, and Machines: www.nearly42.org

Communities (12)

Top network posts

1
gold badge
26
silver badges
57
bronze badges
View all badges

Top tags (135)

Score 236
Posts 50
Posts % 24
Score 193
Posts 47
Score 156
Posts 34
Score 90
Posts 18
Score 82
Posts 21
Score 74
Posts 22
View all tags →

Top posts (209)

All Questions Answers
Votes Newest
23 Is rejection sampling the only way to get a truly uniform distribution of random numbers? Jul 4 '12
21 Classification of intractable/tractable satisfiability problem variants Apr 12 '12
17 Why is this true: “There are countably many Turing Machines” Mar 25 '13
15 Planarity conditions for Planar 1-in-3 SAT Oct 1 '12
15 Using logic to prove non-regularity of a language Jan 18 '16
14 Is computational power of Neural networks related to the activation function Jun 13 '12
13 Boolean search explained May 3 '16
13 If $L_1L_2$ is regular language then $L_2L_1$ is regular to? Dec 4 '15
13 How to prove that a language is not context-free? Jul 3 '13
13 Reachable state space of an 8-puzzle Oct 29 '13
View all questions and answers →

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.