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

hypercomputationcomputationalism

Mathematics Subject Classification ID

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

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

• 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?)
• 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
• 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)

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

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)