A machine that knows its own code

DOI10.1007/S11225-013-9491-6zbMATH Open1307.03023arXiv1305.6080OpenAlexW2951208926MaRDI QIDQ456969FDOQ456969

Samuel A. Alexander

Publication date: 26 September 2014

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

Abstract: We construct a machine that knows its own code, at the price of not knowing its own factivity.

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

Recommendations

• On Turing machines knowing their own Gödel-sentences
• Idealization, mechanism, and knowability
• Knowledge, machines, and the consistency of Reinhardt's strong mechanistic thesis
• Representing the knowledge of Turing machines
• Papers on epistemology

zbMATH Keywords

artificial intelligenceepistemic arithmeticKleene's recursion theoremknowing machinesLucas-Penrose argumentquantified modal logicReinhardt'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)

Cites Work

• Title not available (Why is that?)
• Knowledge, machines, and the consistency of Reinhardt's strong mechanistic thesis
• Ordinal arithmetic and \(\Sigma_1\)-elementarity
• Title not available (Why is that?)
• After Godel
• Absolute Versions of Incompleteness Theorems
• Elementary patterns of resemblance

Cited In (3)

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

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

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