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 ...

This is a preview. Log in through your library . Abstract We prove that the first order theory of the fixed point algebra corresponding to an r.e. consistent theory containing arithmetic is ...