A new Gödelian argument for hypercomputing minds based on the busy beaver problem

作者:

Highlights:

摘要

Do human persons hypercompute? Or, as the doctrine of computationalism holds, are they information processors at or below the Turing Limit? If the former, given the essence of hypercomputation, persons must in some real way be capable of infinitary information processing. Using as a springboard Gödel’s little-known assertion that the human mind has a power “converging to infinity”, and as an anchoring problem Rado’s [T. Rado, On non-computable functions, Bell System Technical Journal 41 (1963) 877–884] Turing-uncomputable “busy beaver” (or Σ) function, we present in this short paper a new argument that, in fact, human persons can hypercompute. The argument is intended to be formidable, not conclusive: it brings Gödel’s intuition to a greater level of precision, and places it within a sensible case against computationalism.

论文关键词:

论文评审过程:Available online 15 November 2005.

论文官网地址:https://doi.org/10.1016/j.amc.2005.09.071