"We have had a lot of inquiries about that,". "And it does not have anything to do with why we are actually down there.

VOA: standard.2009.10.20

Usually when you know why it's not working, it's obvious what you have to do to make it work.

通常你明白了出错的原因后，很明显你必须让程序正常运行起来。

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

And then of course, once we figure out why not, we try and fix it. but today I'm going to emphasize not how do you fix it, but how do you find out what's wrong.

我们就会去尝试着修复程序，但是今天我强调的,并不是怎么去修复，而是怎么找出来错误原因。

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

"The reason why I do not think it is likely is because of all the resources we have put on this, considerably more than the last administration did, to see to it that it will not happen."

VOA: standard.2010.02.14

You remember in the first lecture I said there's a difference between the history of criticism and theory of literature, one difference being that the history of criticism has a great deal to do with literary evaluation: that is to say, why do we care about literature and how can we find means of saying that it's good or not good?

你们还记得吗，第一节课我说过,文学评论历史和文学理论有一个重大区别，那就是文学评论的历史,很大程度上与文学评估有关：,意思就是我们为什么要关心文学,还有我们怎么能说一部作品是好还是坏？

耶鲁公开课 - 文学理论导论课程节选

That's certainly one way to do it, but for computers that's not necessarily the easiest way. So another way of solving it is to do something we already saw last time, which is basically, why not simply enumerate all possible examples and check them?

将一个等式代入另一个等式，这当然是一种办法,但是对电脑来说这绝对不是一件简单的事,所以解决这个问题的办法，正如我们上一次看过的,非常基本？

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

Why did it do that? That's not what I expected.

挺有趣的，噢，怎么回事儿？

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

Yeah. Log. It's a good think, but why do you think it's log? Ah-ha. It's not a bad instinct, the length is getting shorter each time, but what's one of the characteristics of a log algorithm? It drops in half each time.

对了，对数，这是个好想法,但是你们为什么认为是对数呢？,啊哈，这样的本能不错，每次长度都会缩小些,但是对数算法的特性是什么。

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