A machine that knows its own code

DOI10.1007/S11225-013-9491-6zbMath1307.03023arXiv1305.6080OpenAlexW2951208926MaRDI QIDQ456969

Samuel A. Alexander

Publication date: 26 September 2014

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.6080

zbMATH Keywords

artificial intelligencequantified modal logicepistemic arithmeticKleene's recursion theoremknowing machinesLucas-Penrose argumentReinhardt's strong mechanistic thesis

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Logics of knowledge and belief (including belief change) (03B42) Logic in computer science (03B70) Applications of computability and recursion theory (03D80) Turing machines and related notions (03D10)

Related Items (3)

Strengthening Consistency Results in Modal Logic ⋮ Short-circuiting the definition of mathematical knowledge for an artificial general intelligence ⋮ SELF-REFERENTIAL THEORIES

Cites Work

• Unnamed Item
• Unnamed Item
• Knowledge, machines, and the consistency of Reinhardt's strong mechanistic thesis
• Ordinal arithmetic and \(\Sigma_1\)-elementarity
• After Godel
• Absolute Versions of Incompleteness Theorems
• Elementary patterns of resemblance

This page was built for publication: A machine that knows its own code