Skip to main content
Computer Science
Vor's user avatar
Vor's user avatar
Vor's user avatar
Vor
  • Member for 12 years, 6 months
  • Last seen this week
Profile Activity
Stats
12,603
reputation
637k
reached
180
answers
34
questions
Communities
View all
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

Badges
View all badges
1
gold badge
30
silver badges
62
bronze badges
Top tags
View all tags
248
Score
50
Posts
23
Posts %
204
Score
47
Posts
22
Posts %
165
Score
36
Posts
17
Posts %
97
Score
18
Posts
8
Posts %
84
Score
21
Posts
10
Posts %
77
Score
22
Posts
10
Posts %
Top posts
View all questions and answers
question
24
Is rejection sampling the only way to get a truly uniform distribution of random numbers?
Jul 4, 2012
question
22
Classification of intractable/tractable satisfiability problem variants
Apr 12, 2012
answer
21
Why is this true: “There are countably many Turing Machines”
Mar 25, 2013
question
19
Using logic to prove non-regularity of a language
Jan 18, 2016
question
17
Planarity conditions for Planar 1-in-3 SAT
Oct 1, 2012
answer
15
Is computational power of Neural networks related to the activation function
Jun 13, 2012
answer
14
NP-complete proof from Dasgupta problem on Kite
Sep 12, 2012
question
13
Decidable restrictions of the Post Correspondence Problem
Mar 23, 2012
answer
13
How to prove 2-EXP != EXP
Jun 20, 2012
answer
13
Boolean search explained
May 3, 2016
Top network posts
View all network posts
46
What is the smallest Turing machine where it is unknown if it halts or not?
37
Is this variation of TQBF still PSPACE-complete?
35
Can I express any odd number with a power of two minus a prime?
33
Kolmogorov-mania
31
Turing Machine restrictions that render halting decidable