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

但基本上，每个控制结果方案都充满了政治哲学和计算不可约性陷阱。

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

但如今计算不可约性告诉我们这并不是真。

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

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

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.

这就是我所说计算不可约性，在这种情况下， 时间流逝相当于一个我们必须运行不可约计算， 以确定其最终结果。