Computer Science
Vor
  • Member for 9 years, 9 months
  • Last seen more than a month ago
Profile Activity
Stats
12,063
reputation
523k
reached
176
answers
33
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
26
silver badges
57
bronze badges
Top tags
View all tags
237
Score
50
Posts
24
Posts %
195
Score
47
Posts
22
Posts %
156
Score
34
Posts
16
Posts %
90
Score
18
Posts
9
Posts %
82
Score
21
Posts
10
Posts %
74
Score
22
Posts
11
Posts %
Top posts
View all questions, answers, and articles
All Questions Answers Articles
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
18
Why is this true: “There are countably many Turing Machines”
Mar 25 '13
16
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 is $L_2L_1$ regular too?
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
Top network posts
View all network posts
37
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

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.