按年被提到
20072020 · 1 次2026
物理与量子›计算的物理极限·arXiv:0708.1362 · cond-mat.stat-mech

Physical limits of inference

David H. Wolpert · 2007
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2020-06-07 · 最近 2024-01-16
2不同的人
2活跃月份
2讨论串
66被引(OpenAlex)
arXiv 摘要(候选层不写导读)

I show that physical devices that perform observation, prediction, or recollection share an underlying mathematical structure. I call devices with that structure "inference devices". I present a set of existence and impossibility results concerning inference devices. These results hold independent of the precise physical laws governing our universe. In a limited sense, the impossibility results establish that Laplace was wrong to claim that even in a classical, non-chaotic universe the future can be unerringly predicted, given sufficient knowledge of the present. Alternatively, these impossibility results can be viewed as a non-quantum mechanical "uncertainty principle". Next I explore the close connections between the mathematics of inference devices and of Turing Machines. In particular, the impossibility results for inference devices are similar to the Halting theorem for TM's. Furthermore, one can define an analog of Universal TM's (UTM's) for inference devices. I call those analogs "strong inference devices". I use strong inference devices to define the "inference complexity" of an inference task, which is the analog of the Kolmogorov complexity of computing a string. However no universe can contain more than one strong inference device. So whereas the Kolmogorov complexity of a string is arbitrary up to specification of the UTM, there is no such arbitrariness in the inference complexity of an inference task. I end by discussing the philosophical implications of these results, e.g., for whether the universe "is" a computer.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论0d9eooo · 2020-06

“Related: https://arxiv.org/abs/0708.1362 At some point the complexity of a system becomes great enough that it's impossible to simulate it perfectly. The interesting question for me lately is how and under what circumstances can you ignore the complexity for some purpose. For example, underlying what is represented in that poster is some set of physic…”

Reminder of Complexity原评论 ↗
评论derbOac · 2024-01

“This has been on my mind the last few years and I've thought about writing an academic paper about it in one domain. I've sort of increasingly suspected that some domains might involve an intrinsic amount of stochasticity or uncertainty that is baked into things. As in, an amount that becomes nonignorable relative to what you're trying to predict. There…”

How much of the world is it possible to model?原评论 ↗