In this paper we study generic complexity of undecidable problems. It turns out that some classical undecidable problems are, in fact, strongly undecidable, i.e., they are undecidable on every ...

The Post Correspondence Problem is an undecidable problem in which you’re given two lists of strings, and the goal is to find a sequence of indices such that the ...