Many bounded versions of undecidable problems are NP-hard

Most undecidable problems include unbounded parameters in their problem statement. We show that bounding this parameter often leads to NP-hard bounded versions. (arXiv:2211.13532)