The modal argument for hypercomputing minds

DOI10.1016/J.TCS.2003.12.010MaRDI QIDQ1434374zbMATH OpenOpenAlexFDO

Authors Selmer Bringsjord, Konstantine Arkoudas

Publication date 4 August 2004

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2003.12.010

zbMATH Keywords

computationalismhypercomputation

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Turing machines and related notions (03D10)

Review text

Stripped of its trappings, the authors' argument boils down to the following three statements. (1)~We know that it is mathematically/logically impossible for any Turing machine to solve the halting problem of a specified universal TM. (2)~On the other hand, since we can imagine a person performing infinitely many steps of an algorithm in a finite amount of time, it is therefore mathematically/logically (if not necessarily physically) possible for a person to solve that halting problem. (3)~By the two previous statements, people's computational ability exceeds that of TMs. It is certainly possible for a person to find this argument less than convincing.

Recommendations

• A new Gödelian argument for hypercomputing minds based on the busy beaver problem
• On the Possibility, or Otherwise, of Hypercomputation
• Hypercomputation: Philosophical issues
• Superminds. People harness hypercomputation, and more
• The hypercomputation thesis: stakes and philosophical problems

Cites work

• A refutation of Penrose's Gödelian case against artificial intelligence
• Analog computation via neural networks
• Cognition is not computation: The argument from irreversibility
• How minds can be computational systems
• scientific article; zbMATH DE number 3882394 (Why is no real title available?)
• scientific article; zbMATH DE number 3885853 (Why is no real title available?)
• scientific article; zbMATH DE number 1189126 (Why is no real title available?)
• scientific article; zbMATH DE number 3727583 (Why is no real title available?)
• scientific article; zbMATH DE number 47306 (Why is no real title available?)
• scientific article; zbMATH DE number 1048637 (Why is no real title available?)
• scientific article; zbMATH DE number 2001417 (Why is no real title available?)
• scientific article; zbMATH DE number 1869985 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• scientific article; zbMATH DE number 3325547 (Why is no real title available?)
• scientific article; zbMATH DE number 3349336 (Why is no real title available?)
• scientific article; zbMATH DE number 3051296 (Why is no real title available?)
• Infinite time Turing machines
• Limiting recursion
• Mechanism, truth, and Penrose's new argument
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Recursively enumerable sets of positive integers and their decision problems
• Superminds. People harness hypercomputation, and more
• Systems of Logic Based on Ordinals^†
• Taming the infinite
• Trial and error predicates and the solution to a problem of Mostowski
• Turing's O-machines, Searle, Penrose and the brain
• What robots can and can't be
• Why Gödel's theorem cannot refute computationalism

Cited in

(13)

• Superminds. People harness hypercomputation, and more
• A computational journey into the mind
• A new Gödelian argument for hypercomputing minds based on the busy beaver problem
• The case for hypercomputation
• The myth of `the myth of hypercomputation'
• The grammar of mammalian brain capacity
• God, souls, and Turing: in defense of the theological objection to the Turing test
• scientific article; zbMATH DE number 2013794 (Why is no real title available?)
• scientific article; zbMATH DE number 1869996 (Why is no real title available?)
• scientific article; zbMATH DE number 1909826 (Why is no real title available?)
• Ideal negative conceivability and the halting problem
• The epistemology of computer-mediated proofs
• Small steps toward hypercomputation via infinitary machine proof verification and proof generation

This page was built for publication: The modal argument for hypercomputing minds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1434374)