dorsal/arxiv
View SchemaTranscending the Limits of Turing Computability
| Authors | Vadim A. Adamyan, Cristian S. Calude, Boris S. Pavlov |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0304128 |
| URL | https://arxiv.org/abs/quant-ph/0304128 |
Abstract
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.
{
"annotation_id": "b8de6924-b31f-442b-b32d-ae4c92c5ad53",
"date_created": "2026-03-02T18:01:59.609000Z",
"date_modified": "2026-03-02T18:01:59.609000Z",
"file_hash": "e68f935b64e017c6629f5db0721ae58038259f935666fa7dd8a1f9d9eb188506",
"private": false,
"record": {
"abstract": "Hypercomputation or super-Turing computation is a ``computation\u0027\u0027 that\ntranscends the limit imposed by Turing\u0027s model of computability. The field\nstill faces some basic questions, technical (can we mathematically and/or\nphysically build a hypercomputer?), cognitive (can hypercomputers realize the\nAI dream?), philosophical (is thinking more than computing?). The aim of this\npaper is to address the question: can we mathematically build a hypercomputer?\nWe will discuss the solutions of the Infinite Merchant Problem, a decision\nproblem equivalent to the Halting Problem, based on results obtained in\n\\cite{Coins,acp}. The accent will be on the new computational technique and\nresults rather than formal proofs.",
"arxiv_id": "quant-ph/0304128",
"authors": [
"Vadim A. Adamyan",
"Cristian S. Calude",
"Boris S. Pavlov"
],
"categories": [
"quant-ph"
],
"title": "Transcending the Limits of Turing Computability",
"url": "https://arxiv.org/abs/quant-ph/0304128"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "31c3069a-4cad-47fc-8b58-82344f9d4472",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}