The complexity of proving chaoticity and the Church-Turing thesis |
| |
| Authors: | Calude Cristian S Calude Elena Svozil Karl |
| |
| Affiliation: | Department of Computer Science, University of Auckland, Private Bag 92019, 1142 Auckland, New Zealand. cristian@cs.auckland.ac.nz |
| |
| Abstract: | ![]()
Proving the chaoticity of some dynamical systems is equivalent to solving the hardest problems in mathematics. Conversely, classical physical systems may "compute the hard or even the incomputable" by measuring observables which correspond to computationally hard or even incomputable problems. |
| |
| Keywords: | |
| 本文献已被 PubMed 等数据库收录！ |
|
