کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4637517 1340742 2006 15 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A new Gödelian argument for hypercomputing minds based on the busy beaver problem
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
A new Gödelian argument for hypercomputing minds based on the busy beaver problem
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 176, Issue 2, 15 May 2006, Pages 516–530
نویسندگان
, , , , , , , ,