Page "Time hierarchy theorem" Paragraph 19

If H < sub > f </ sub > is in this time complexity class, it means we can construct some machine K which, given some machine description and input x, decides whether the tuple (, x ) is in H < sub > f </ sub > within.