https://doi.org/10.4169/college.math.j.42.5.350 https://www.jstor.org/stable/10.4169/college.math.j.42.5.350 The College Mathematics Journal emphasizes the first two ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback