1.But now computational irreducibility shows us that that isn't true.

在计算不可约性告诉我们事实并非如此。机翻

2.So what will it feel like if our world is full of computational irreducibility?

那么，如果我们的界充满了计算不可约性，会是什么样的感觉呢？机翻

3.But basically, every control the outcome schemeseems full of both political philosophyand computational irreducibility gotchas.

基本上，每结果方案似乎都充满了政治哲学和计算不可约性陷阱。机翻

4.There's what I call computational irreducibility, in which, in effect, the passage of time corresponds to an irreducible computationthat we have to run in order to work out how it will turn out.

这就是我所说的计算不可约性，其中，实际上，时间的流逝对应于不可约计算，我们必须运行该计算才能弄清楚结果如何。机翻