Theoretical Computer Science
Meta user
Network profile
18,672
reputation
2
45
114

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

243
answers
36
questions
~300k
people reached
  • nearly42.org
  • Member for 8 years, 5 months
  • 2,543 profile views
  • Last seen 9 hours ago

Communities (10)

Top Meta Posts
3
1

Top network posts

Top tags (160)

Score 469
Posts 93
Posts % 33
Score 220
Posts 51
Score 210
Posts 47
Score 188
Posts 25
Score 155
Posts 25
Score 140
Posts 34
View all tags →

Top posts (279) All Questions Answers | Votes Newest

37 What is the smallest Turing machine where it is unknown if it halts or not? Feb 11 '14
30 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 How much time to recognize palindromes in logarithmic space? Mar 3 '14
23 A simple problem whose decidability is not known Sep 4 '13
22 What is the “nearest” problem to the Collatz conjecture that has been successfully resolved? Jun 2 '12
22 Techniques for showing that problem is in hardness “limbo” Feb 6 '14
21 Languages that we cannot (dis)prove to be Context-Free Apr 5
21 Dark Integers: General Purpose Computations on Internet Routers May 25 '11
View all questions and answers →

Badges (161)

Gold

2

Rarest

Silver

45

Rarest

Bronze

114

Rarest

View all badges →