Diagonalization is a frequently used technique in complexity theory. However, the problems (sets) that are created by diagonalization rarely correspond to anything natural. It would be interesting to collect examples, when a problem was originally defined via diagonalization, but later it was found to coincide with a natural problem.
$\begingroup$
$\endgroup$
6
-
$\begingroup$ it is in a way hard to argue that any TM complete problem is any more "natural" than any other, they are equivalent and there seems to be no "natural" way of discriminating them except perhaps by # of states in the TMs etc.... $\endgroup$– vznCommented Feb 8, 2014 at 1:45
-
$\begingroup$ fairly close to easy to understand undecidable problem, Mathematics $\endgroup$– vznCommented Feb 8, 2014 at 1:56
-
$\begingroup$ similar also to simplest TM complete system(s) tcs.se $\endgroup$– vznCommented Feb 8, 2014 at 2:05
-
$\begingroup$ @vzn: The question didn't say anything about completeness... $\endgroup$– Joshua GrochowCommented Feb 8, 2014 at 2:17
-
$\begingroup$ ok but it did not rule it out either as in your answer... $\endgroup$– vznCommented Feb 8, 2014 at 2:19
|
Show 1 more comment
1 Answer
$\begingroup$
$\endgroup$
In some sense the halting problem satisfies this request (I was almost ready to say "There are no such examples!" when I thought of this one.) By doing diagonalization against computable sets, you can of course get sets of very high complexity, but the seemingly-most-natural way of diagonalizing against computable sets gives you a problem that is equivalent to the halting problem. As we now know, the halting problem is equivalent to many other computational problems, such as deciding many properties of TMs, telling whether a Diophantine equation has solutions, the word problem in finitely presented groups, telling whether a high-dimensional knot is the unknot, etc.
I am still ready to say that I would be surprised to see other examples (that aren't just, say, relativized versions of this).
answered Feb 8, 2014 at 1:34