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
Member for 7 years, 1 month
13 profile views
Last seen Sep 24 '18 at 9:51
- Theoretical Computer Science 21.4k 21.4k 22 gold badges4848 silver badges118118 bronze badges
- Computer Science 11.8k 11.8k 11 gold badge2525 silver badges5555 bronze badges
- MathOverflow 1.6k 1.6k 1010 silver badges2121 bronze badges
- Mathematics 640 640 33 silver badges1818 bronze badges
- Code Golf 445 445 55 silver badges1212 bronze badges
- View network profile
Top network posts
- 38 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?
- 32 Kolmogorov-mania
- 31 Turing Machine restrictions that render halting decidable
- 28 Natural NP-complete problems with "large" witnesses
- 25 A simple decision problem whose decidability is not known
- View more network posts →