Turing‐computability and artificial intelligence: Gödel’s incompleteness results
Sang Wu Kim
(Korea Advanced Institute of Science and Technology, Taejön, Korea)
S.M. Kim
(Yonsei University, Seoul, Korea)
294
Abstract
Establishes the claims that Gödel’s Incompleteness Theorems cannot prove the existence or the non‐existence of a machine proving all mathematical truths; there exists a machine proving all mathematical truths and the AI thesis is correct.
Keywords
Citation
Wu Kim, S. and Kim, S.M. (1995), "Turing‐computability and artificial intelligence: Gödel’s incompleteness results", Kybernetes, Vol. 24 No. 6, pp. 57-62. https://doi.org/10.1108/03684929510094316
Publisher
:MCB UP Ltd
Copyright © 1995, MCB UP Limited