OK. How can we check, for example, if it does or if it doesn't seem reasonable.

我们如何检查呢？举个例子，看它是否合理或者不合理。

麻省理工公开课 - 化学原理课程节选

So, I've never heard the click-click-click-click-click, and we might bring a Geiger counter in here some time later in the semester so we can check all of you out, and hopefully we won't hear any when we do that either.

但我知道如果,你听到哒哒哒的声音，就表明你有麻烦了，我从来没听到过哒哒哒的声音,也许以后我可以带一个,来课堂上检测你们每一个人，希望我们不会听到哒哒哒的声音。

麻省理工公开课 - 化学原理课程节选

We can work it out at home and check it carefully, but this isn't that incorrect.

大家回家后可以仔细画一下,但并非意味着黑板上的不对

耶鲁公开课 - 博弈论课程节选

And so can we do a little sanity check with the simple case here?

对这个简单的例子我们能不能做完整性检查呢？

哈佛公开课 - 计算机科学课程节选

So we can sort of check the progress of the code.

而并不仅仅是返回一个最终结果。

麻省理工公开课 - 计算机科学及编程导论课程节选

Well, the reason, the way that we can check it is just to see if it's in between our two extreme 1 cases. We know that it has to be more than 1, because even if we had total shielding, 1 we would at least feel is the effective of 1.

好的我们可以检查它的原因和方式是观察,它是否在我们的两种极端案例之间,我们知道它必须大于，因为即使如果我们有完全的屏蔽，我们最小感到的有效值是。

麻省理工公开课 - 化学原理课程节选

So let's charge it up again and see if we can check again.

让我们再次给它充电看看,是否能再次观测到。

麻省理工公开课 - 化学原理课程节选

And so here do we see we can check for equality with zero.

然后这里我们可以检查与0等价的情况了。

哈佛公开课 - 计算机科学课程节选

All right, so in fact, if we checked the Nash equilibria in this game, the Nash Equilibria, and you can check that they are in fact best responses, are both people doing The Bourne ultimatum or both people doing The Good Shepherd.

很好,实际上,如果我们仔细看一下这个博弈,就会发现它们纳什均衡就是最佳对策,即两个人都去看《谍影重重》,或是两人都去看《特工风云》

耶鲁公开课 - 博弈论课程节选

But that merging process only takes N steps, N*log N so that's N times log of N. Now, it's a little tricky to reason through this perhaps the first time, let's just take a very simple example and see if we can do a little sanity check here.

但这个合并过程只需要N步，所以时间复杂度是,第一次对此进行推论可能会有点儿棘手，我们举一个简单的例子,看看我们能否做一些完整性的检查。

哈佛公开课 - 计算机科学课程节选

And so if incidentally, you're a representative of a student group and the alike and your Google calendar is not -- in here, you can check just by flipping through the various-- we have over 200 calendars right now and you can search through them here.

如果你是一个学生团体的代表,你的Google日历在此不存在,你可以检查其他各种各样的-,目前我们有200多种日历,你可以在它们之中进行查找。

哈佛公开课 - 计算机科学课程节选