Can Turing machines capture everything we can compute?
| dc.creator | Anand, Bhupinder Singh | |
| dc.date | 2003-04-24 | |
| dc.date | 2003-05-17 | |
| dc.date.accessioned | 2026-07-07T04:57:20Z | |
| dc.date.available | 2026-07-07T04:57:20Z | |
| dc.description | If we define classical foundational concepts constructively, and introduce non-algorithmic effective methods into classical mathematics, then we can bridge the chasm between truth and provability, and define computational methods that are not Turing-computable. | |
| dc.description | v2; introduced standardised ACI compliant notation for citations; 13 pages; an HTML version is available at http://alixcomsi.com/Can_Turing_machines.htm | |
| dc.identifier | https://arxiv.org/abs/math/0304379 | |
| dc.identifier | http://arxiv.org/abs/math/0304379 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/67230 | |
| dc.subject | General Mathematics | |
| dc.subject | 03B10 | |
| dc.title | Can Turing machines capture everything we can compute? | |
| dc.type | text |