Computer Science
Meta user
Network profile
10,284
reputation
1
23
54

Vor

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

164
answers
31
questions
~357k
people reached
  • nearly42.org
  • Member for 7 years, 3 months
  • 844 profile views
  • Last seen 22 hours ago

Communities (10)

Top network posts

Top tags (127)

Score 228
Posts 49
Posts % 25
Score 176
Posts 43
Score 146
Posts 33
Score 88
Posts 18
Score 76
Posts 21
Score 70
Posts 19
View all tags →

Top posts (195) All Questions Answers | Votes Newest

20 Is rejection sampling the only way to get a truly uniform distribution of random numbers? Jul 4 '12
20 Classification of intractable/tractable satisfiability problem variants Apr 12 '12
16 Why is this true: “There are countably many Turing Machines” Mar 25 '13
14 Planarity conditions for Planar 1-in-3 SAT Oct 1 '12
14 Using logic to prove non-regularity of a language Jan 18 '16
13 Decidable restrictions of the Post Correspondence Problem Mar 23 '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 How to prove 2-EXP != EXP Jun 20 '12
View all questions and answers →

Badges (78)

Gold

1

Rarest

Silver

23

Rarest

Bronze

54

Rarest

View all badges →