Is P closed under subwords?
Hint: Let $L$ be the language consisting of a description of a Turing machine (bounded by $\#$ on both sides) followed by a terminating computation (both description and computation are over $\{0,1\}$). What is the language $\mathit{subwords}(L) \cap \#\Sigma^*\#$?