mlsanityData to 14 Oct 2026

From G"odel's Incompleteness Theorem to the completeness of bot beliefs (Extended abstract)

arXiv 2303.14338 ↗First posted 25 Mar 2023cs.AI cs.LG cs.LOcited by 0

Not on the map. Why?

Abstract (arXiv)

Hilbert and Ackermann asked for a method to consistently extend incomplete theories to complete theories. G"odel essentially proved that any theory capable of encoding its own statements and their proofs contains statements that are true but not provable. Hilbert did not accept that G"odel's construction answered his question, and in his late writings and lectures, G"odel agreed that it did not, since theories can be completed incrementally, by adding axioms to prove ever more true statements, as science normally does, with completeness as the vanishing point. This pragmatic view of validity is familiar not only to scientists who conjecture test hypotheses but also to real estate agents and other dealers, who conjure claims, albeit invalid, as necessary to close a deal, confident that they will be able to conjure other claims, albeit invalid, sufficient to make the first claims valid. We study the underlying logical process and describe the trajectories leading to testable but unfalsifiable theories to which bots and other automated learners are likely to converge.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 1 of its 44 references that are in the map. First posted on arXiv 25 Mar 2023.

Builds on

1 of 44 references.

References · 1

  1. 2017Monoidal computer III: A coalgebraic view of computability and complexitycited by 2

Built on by

Not cited yet.