Theoretical Computer Science
Profile Activity
Meta user
Network profile
21,996
reputation
2
50
122

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

255
answers
40
questions
~380k
people reached
  • nearly42.org
  • Member for 10 years, 6 months
  • 2,856 profile views
  • Last seen 3 hours ago

Communities (12)

Top Meta Posts
3
1

Top network posts

Top tags (162)

Score 508
Posts 95
Posts % 32
Score 236
Posts 52
Score 221
Posts 53
Score 198
Posts 25
Score 168
Posts 27
Score 147
Posts 29
View all tags →

Top posts (295)

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 A simple decision problem whose decidability is not known Sep 4 '13
28 Natural NP-complete problems with “large” witnesses Oct 26 '14
25 How much time to recognize palindromes in logarithmic space? Mar 3 '14
24 Techniques for showing that problem is in hardness “limbo” Feb 6 '14
23 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 (174)

Gold

2

Rarest

Silver

50

Rarest

Bronze

122

Rarest

View all badges →

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.