I've noticed that the certificate/verification version of the definition of the class NP is much more popular online than the Turing machine version. In particular, the Wikipedia page has the certificate version stating
NP is the set of decision problems for which the problem instances, where the answer is "yes", have proofs verifiable in polynomial time by a deterministic Turing machine.
listed first, and Google's featured result (via Britannica) has this version. This seems to be especially true for explanations aimed at wider audiences such as YouTube videos from popular creators (i.e. not lectures on the subject or course recordings) such as here and here).
Is there a fundamental reason why this appears to be the preferred presentation online?