arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1103.1127gr-qccs.CC
收藏

计算与时空结构

Computation and Spacetime Structure

Mike Stannett

摘要:

我们调查计算和时空结构之间的关系,专注于封闭的类时曲线(CTC)在促进计算加速的作用。我们首先注意到,CTC遍历可以用两种不同的方式来解释,这取决于人们对时空的理解。专注于一种解释导致我们开发一个玩具宇宙,其中没有CTC可以遍历一次以上,因此没有计算加速是可能的。关注第二种(也是更标准的)解释,我们会得出一个令人惊讶的结论:CTC是完美的信息库:就像黑洞有熵一样,CTC也有熵。如果我们还假设P不等于NP,我们发现所有的观察者都同意,即使在他们年轻时存在无限时间旅行,这种能力最终会随着年龄的增长而消失。因此,计算假设“P不是NP”也是一个关于宇宙结构的假设。

英文摘要:

We investigate the relationship between computation and spacetime structure, focussing on the role of closed timelike curves (CTCs) in promoting computational speedup. We note first that CTC traversal can be interpreted in two distinct ways, depending on ones understanding of spacetime. Focussing on one interpretation leads us to develop a toy universe in which no CTC can be traversed more than once, whence no computational speedup is possible. Focussing on the second (and more standard) interpretation leads to the surprising conclusion that CTCs act as perfect information repositories: just as black holes have entropy, so do CTCs. If we also assume that P is not equal to NP, we find that all observers agree that, even if unbounded time travel existed in their youth, this capability eventually vanishes as they grow older. Thus the computational assumption "P is not NP" is also an assumption concerning cosmological structure.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑