arrow
Return

Some thoughts on hypercomputation

delete2006-07-01
delete8
PRE
AI
N
Newton C. A. da Costa
DOI:10.1016/j.amc.2005.09.073delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

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

Applied Mathematics and Computation cover
Applied Mathematics and Computation
IF:
3.4
Papers:
2.3W
Citations:
3.3W

Organization

No organization information available