NP中的每个问题都可以归约为可满足性问题，这是计算复杂性理论的基石。
Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
故事不只是被讲述；它被那些阅读它的人所经历。
教育的艺术必须从教育的科学中衍生出其规则。
CRISPR的潜力只受限于我们的想象力和责任感。
在一个不断试图让你成为别人的世界里做自己，是最伟大的成就。
Sustainability isn't an option; it's the only path forward for aquaculture.
You have to believe in yourself, even when no one else does.
使精神达到玄寂境界，断绝尘世烦恼，这就是涅槃
"Life is either a daring adventure or nothing at all."