Return
Some thoughts on hypercomputation
DOI:10.1016/j.amc.2005.09.073.png)
Abstract
En 中文
We first show that the Halting Function (the noncomputable function that solves the Halting Problem) has explicit expressions in the language of calculus. Out of that fact we elaborate on the possible meaning of hypercomputation theory within the setting of formal mathematical theories. (c) 2005 Elsevier Inc. All rights reserved.
Keywords:
2 UNDECIDABLE PROBLEMS
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available

