Is a deterministic universe logically consistent with a probabilistic Quantum Theory?
| dc.creator | Anand, Bhupinder Singh | |
| dc.date | 2002-12-31 | |
| dc.date | 2003-01-02 | |
| dc.date.accessioned | 2026-07-07T04:54:09Z | |
| dc.date.available | 2026-07-07T04:54:09Z | |
| dc.description | If we assume the Thesis that any classical Turing machine T, which halts on every n-ary sequence of natural numbers as input, determines a PA-provable formula, whose standard interpretation is an n-ary arithmetical relation f(x1, >..., xn) that holds if, and only if, T halts, then standard PA can model the state of a deterministic universe that is consistent with a probabilistic Quantum Theory. Another significant consequence of this Thesis is that every partial recursive function can be effectively defined as total. | |
| dc.description | 12 pages. Revision 1. Appendix 1 added. An HTML version is available at http://alixcomsi.com/index01.htm | |
| dc.identifier | https://arxiv.org/abs/math/0212388 | |
| dc.identifier | http://arxiv.org/abs/math/0212388 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/66131 | |
| dc.subject | General Mathematics | |
| dc.subject | 03B10 | |
| dc.title | Is a deterministic universe logically consistent with a probabilistic Quantum Theory? | |
| dc.type | text |