| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Theory of Knowing Machines: Revisiting Gödel and the Mechanistic Thesis
Abstract : Church-Turing Thesis, mechanistic project, and Gödelian Arguments offer different perspectives of informal intuitions behind the relationship existing between the notion of intuitively provable and the definition of decidability by some Turing machine. One of the most formal lines of research in this setting is represented by the theory of knowing machines, based on an extension of Peano Arithmetic, encompassing an epistemic notion of knowledge formalized through a modal operator denoting intuitive provability. In this framework, variants of the Church-Turing Thesis can be constructed and interpreted to characterize the knowledge that can be acquired by machines. In this paper, we survey such a theory of knowing machines and extend some recent results proving that a machine can know its own code exactly but cannot know its own correctness (despite actually being sound). In particular, we define a machine that, for (at least) a specific case, knows its own code and knows to be sound.
Cited literature [31 references]
https://hal.inria.fr/hal-01615307
Contributor : Hal Ifip <>
Submitted on : Thursday, October 12, 2017 - 11:22:20 AM
Last modification on : Tuesday, November 26, 2019 - 1:18:07 PM
Contributor : Hal Ifip <>
Submitted on : Thursday, October 12, 2017 - 11:22:20 AM
Last modification on : Tuesday, November 26, 2019 - 1:18:07 PM
File
432590_1_En_4_Chapter.pdf
Files produced by the author(s)
Licence
Distributed under a Creative Commons Attribution 4.0 International License