Transcending the Limits of Turing Computability
| dc.creator | Adamyan, Vadim A. | |
| dc.creator | Calude, Cristian S. | |
| dc.creator | Pavlov, Boris S. | |
| dc.date | 2003-04-19 | |
| dc.date | 2003-05-11 | |
| dc.date.accessioned | 2026-07-07T06:06:36Z | |
| dc.date.available | 2026-07-07T06:06:36Z | |
| dc.description | Hypercomputation or super-Turing computation is a ``computation'' that transcends the limit imposed by Turing's model of computability. The field still faces some basic questions, technical (can we mathematically and/or physically build a hypercomputer?), cognitive (can hypercomputers realize the AI dream?), philosophical (is thinking more than computing?). The aim of this paper is to address the question: can we mathematically build a hypercomputer? We will discuss the solutions of the Infinite Merchant Problem, a decision problem equivalent to the Halting Problem, based on results obtained in \cite{Coins,acp}. The accent will be on the new computational technique and results rather than formal proofs. | |
| dc.description | 13 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0304128 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0304128 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/91032 | |
| dc.subject | Quantum Physics | |
| dc.title | Transcending the Limits of Turing Computability | |
| dc.type | text |