scientific article; zbMATH DE number 1869985

DOI10.1023/A:1011257022242zbMath1035.68516OpenAlexW1573589182MaRDI QIDQ4792697

Selmer Bringsjord

Publication date: 17 February 2003

Published in: Minds and Machines (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011257022242

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Turing machinesparallel computationartificial intelligencesimulation proofsuncomputable functions

Mathematics Subject Classification ID

General topics in artificial intelligence (68T01)

Related Items (3)

The modal argument for hypercomputing minds ⋮ A new Gödelian argument for hypercomputing minds based on the busy beaver problem ⋮ THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION'

This page was built for publication: