The modal argument for hypercomputing minds
From MaRDI portal
Publication:1434374
DOI10.1016/j.tcs.2003.12.010zbMath1058.03006OpenAlexW2151123656MaRDI QIDQ1434374
Konstantine Arkoudas, Selmer Bringsjord
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
Philosophical and critical aspects of logic and foundations (03A05) Turing machines and related notions (03D10)
Related Items
The grammar of mammalian brain capacity, God, souls, and Turing: in defense of the theological objection to the Turing test, A new Gödelian argument for hypercomputing minds based on the busy beaver problem, The case for hypercomputation, The Epistemology of Computer-Mediated Proofs, THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION'
Cites Work
- What robots can and can't be
- Why Gödel's theorem cannot refute computationalism
- Cognition is not computation: The argument from irreversibility
- Analog computation via neural networks
- Superminds. People harness hypercomputation, and more
- Taming the infinite
- Mechanism, truth, and Penrose's new argument
- How minds can be computational systems
- Turing's O-machines, Searle, Penrose and the brain
- Infinite time Turing machines
- A refutation of Penrose's Gödelian case against artificial intelligence
- Trial and error predicates and the solution to a problem of Mostowski
- Limiting recursion
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Systems of Logic Based on Ordinals†
- Recursively enumerable sets of positive integers and their decision problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item