Theoretical Computer Science
Profile Activity
Meta user
Network profile
21,673
reputation
2
49
120

Marzio De Biasi

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

253
answers
40
questions
~367k
people reached
  • nearly42.org
  • Member for 10 years, 1 month
  • 2,809 profile views
  • Last seen 8 hours ago

Communities (12)

Top Meta Posts
3
1

Top network posts

Top tags (162)

Score 505
Posts 95
Posts % 32
Score 233
Posts 52
Score 220
Posts 53
Score 196
Posts 25
Score 163
Posts 26
Score 146
Posts 29
View all tags →

Top posts (293)

All Questions Answers
Votes Newest
37 What is the smallest Turing machine where it is unknown if it halts or not? Feb 11 '14
37 Is this variation of TQBF still PSPACE-complete? Sep 3 '14
30 Turing Machine restrictions that render halting decidable May 12 '16
28 Natural NP-complete problems with “large” witnesses Oct 26 '14
27 A simple decision problem whose decidability is not known Sep 4 '13
25 How much time to recognize palindromes in logarithmic space? Mar 3 '14
23 Techniques for showing that problem is in hardness “limbo” Feb 6 '14
22 What is the “nearest” problem to the Collatz conjecture that has been successfully resolved? Jun 2 '12
21 Direct SAT to 3-SAT reduction Jul 3 '11
21 Languages that we cannot (dis)prove to be Context-Free Apr 5 '19
View all questions and answers →

Badges (171)

Gold

2

Rarest

Silver

49

Rarest

Bronze

120

Rarest

View all badges →