  In this note we introduce a notion of a generically (strongly generically)
NP-complete problem and show that the randomized bounded version of the halting
problem is strongly generically NP-complete.
