Small steps toward hypercomputation via infinitary machine proof verification and proof generation

DOI10.1007/978-3-642-39074-6_11MaRDI QIDQ5300915zbMATH OpenOpenAlexFDO

Authors Naveen Sundar Govindarajulu, John Licato, Selmer Bringsjord

Publication date 28 June 2013

Published in Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39074-6_11

Mathematics Subject Classification ID

Recommendations

• Analog computation beyond the Turing limit
• The modal argument for hypercomputing minds
• Infinite time Turing machines
• A new Gödelian argument for hypercomputing minds based on the busy beaver problem
• Hypercomputation: Philosophical issues

Cited in

(1)

• The epistemology of computer-mediated proofs

This page was built for publication: Small steps toward hypercomputation via infinitary machine proof verification and proof generation

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