The subset-sum problem is one of the most frequently occurring NP (nondeterministic, polynomial-time)-complete) problems. It asks whether a subset of numbers in a set of positive integers adds up ...

In computational complexity theory, P and NP are two classes of problems. P is the class of decision problems that a deterministic Turing machine can solve in polynomial time. In useful terms, any ...

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