Theoretical Computer Science
Profile Activity
Meta user
Network profile
21,152
reputation
2
47
117

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

248
answers
39
questions
~333k
people reached
  • nearly42.org
  • Member for 9 years, 2 months
  • 2,662 profile views
  • Last seen 14 hours ago

Communities (10)

Top Meta Posts
3
1

Top network posts

Top tags (161)

Score 490
Posts 94
Posts % 33
Score 224
Posts 48
Score 220
Posts 53
Score 190
Posts 25
Score 157
Posts 25
Score 145
Posts 29
View all tags →

Top posts (287)

All Questions Answers
Votes Newest
38 What is the smallest Turing machine where it is unknown if it halts or not? Feb 11 '14
35 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
25 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 Languages that we cannot (dis)prove to be Context-Free Apr 5 '19
21 Dark Integers: General Purpose Computations on Internet Routers May 25 '11
View all questions and answers →

Badges (166)

Gold

2

Rarest

Silver

47

Rarest

Bronze

117

Rarest

View all badges →