Undecidability and intractability in theoretical physics 论文

1985Physical Review Letters引用 237
Cellular Automata and ApplicationsComputability, Logic, AI AlgorithmsTheoretical and Computational Physics

摘要

Physical Processes are reviewed as computations, and the difficulty of answering questions about them is characterized in terms of the difficulty of performing the corresponding computations. Cellular automata are used to provide explicit examples of various formally undecidable and computationally intractable problems. It is suggested that such problems are common in physical models, and some other potential examples are discussed.

相关事件

暂无数据

相关文章

暂无数据