{
  "id": "quant-ph/0304128",
  "version": "v2",
  "published": "2003-04-19T06:16:38.000Z",
  "updated": "2003-05-11T20:40:54.000Z",
  "title": "Transcending the Limits of Turing Computability",
  "authors": [
    "Vadim A. Adamyan",
    "Cristian S. Calude",
    "Boris S. Pavlov"
  ],
  "comment": "13 pages, 1 figure",
  "categories": [
    "quant-ph"
  ],
  "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.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2003-05-11T20:40:54.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "turing computability",
      "hypercomputer",
      "infinite merchant problem",
      "decision problem equivalent",
      "ai dream"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 13,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2003quant.ph..4128A"
    }
  }
}