Computational Possibility
Teasers > Axioms
1.9. Computational Possibility
The Truth and the absoluteness of the Good are transcendent concepts that, in light of Gödel’s Incompleteness Theorem [1], are not fully formalizable within computational logic. It is, however, possible to define which things and actions are good and to be promoted. Within the limits of the Theorem, truth corresponds to the congruence between definitions, while absoluteness refers to algorithmic integrity. This integrity requires the absence of exceptions, as well as the absence of inconsistent definitions or promotions, including any previously introduced through permissions or permissiveness for an illusory consensus.
The prudent and constant recourse to the judgment of persons defined as competent in specific subjects is a valid, though humanly imperfect, tool for aspiring to a logic and an ethics oriented toward the Good. This is the practicable path to move ever closer to the absolute and perfect Truth, while remaining aware of the unreachability of such a high aspiration.
[1] Cf. K. Gödel, Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I, in Monatshefte für Mathematik und Physik, Vol. 38, no. 1 (1931), pp. 173–198.