There doesn't exist an algorithm which decides on the following problem: Does a given Turing machine work in time limited by $5n$? $n$ is the length of $w$. $w$ is an input word.
The answer is:
No, because if it was true then we would decide on problem: Does an universal machine accept a word $w$.
I don't understand why that argument works. Please explain.