Quantum Principles and Mathematical Computability
| dc.creator | Kieu, Tien D | |
| dc.date | 2002-05-16 | |
| dc.date | 2002-11-18 | |
| dc.date.accessioned | 2026-07-07T06:04:10Z | |
| dc.date.available | 2026-07-07T06:04:10Z | |
| dc.description | Taking the view that computation is after all physical, we argue that physics, particularly quantum physics, could help extend the notion of computability. Here, we list the important and unique features of quantum mechanics and then outline a quantum mechanical "algorithm" for one of the insoluble problems of mathematics, the Hilbert's tenth and equivalently the Turing halting problem. The key element of this algorithm is the {\em computability} and {\em measurability} of both the values of physical observables and of the quantum-mechanical probability distributions for these values. | |
| dc.description | 9 pages in A4 size and 10pt fonts, 3 figures. Modified with a new reference added for submission to QS2002 | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0205093 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0205093 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/90206 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum Principles and Mathematical Computability | |
| dc.type | text |