Gödel, Chaitin, Wolfram, and Doolittle – The Limits of Decidability
Gödel, Chaitin, Wolfram, and Doolittle are all working on a similar problem space—namely, the limits of decidability, computability, and formal systems—but from different domains and with different purposes. Here’s a structured comparison across seven dimensions: ternary logic, evolutionary computation, constructive logic, ethics, testimony, and decidability, focusing on Doolittle’s differences with them.
Problem Solved: Demonstrated that in any sufficiently expressive formal system, there exist true statements that are unprovable within the system.
Method: Proof via binary logic and formal arithmetic.
Contribution: Set epistemic limits on formal, axiomatic systems (math, logic).
Focus: Negativa—what you cannot do.
Limitation: Didn’t attempt to operationalize or embed in human action or computation.
Contrast: Doolittle treats Gödel’s incompleteness as a boundary condition, but aim to operate within those constraints using ternary logic (truth, falsehood, undecidability) and constructive methods, to extend decidability into behavior, law, and economics by empirical rather than purely formal means.
Method: Proof via binary logic and formal arithmetic.
Contribution: Set epistemic limits on formal, axiomatic systems (math, logic).
Focus: Negativa—what you cannot do.
Limitation: Didn’t attempt to operationalize or embed in human action or computation.
Contrast: Doolittle treats Gödel’s incompleteness as a boundary condition, but aim to operate within those constraints using ternary logic (truth, falsehood, undecidability) and constructive methods, to extend decidability into behavior, law, and economics by empirical rather than purely formal means.
Problem Solved: Proved that randomness and incompressibility are intrinsic to formal systems.
Method: Introduced Kolmogorov complexity, Ω (Chaitin’s constant), showing that there’s a limit to compressibility (and thus predictability).
Contribution: Proved irreducible complexity in mathematics and computation.
Focus: Epistemological entropy in symbolic representation.
Limitation: Doesn’t extend into ethics, behavior, or institutional design.
Contrast: You extend this insight into epistemic accounting—but rather than treating incompressibility as a terminal point, you account for it operationally via testimonial adversarialism, embedding it in your science of decidability that survives contact with reality.
Method: Introduced Kolmogorov complexity, Ω (Chaitin’s constant), showing that there’s a limit to compressibility (and thus predictability).
Contribution: Proved irreducible complexity in mathematics and computation.
Focus: Epistemological entropy in symbolic representation.
Limitation: Doesn’t extend into ethics, behavior, or institutional design.
Contrast: You extend this insight into epistemic accounting—but rather than treating incompressibility as a terminal point, you account for it operationally via testimonial adversarialism, embedding it in your science of decidability that survives contact with reality.
Problem Solved: Demonstrated that simple rules can generate complex, often irreducible, behavior—most of it undecidable without simulation.
Method: Explores cellular automata and rule-based computation.
Contribution: Operationalized evolutionary computation, but mostly as a descriptive ontology.
Focus: Demonstrates emergence, not decidability.
Limitation: Stays in the domain of physical and mathematical systems; doesn’t formalize social institutions or law.
Contrast: Where Wolfram ends with computational irreducibility, Doolittle begins with it—treating human cognition and cooperation as an attempt to manage it via constructive decidability using operational logic and adversarial testing of testimony.
Method: Explores cellular automata and rule-based computation.
Contribution: Operationalized evolutionary computation, but mostly as a descriptive ontology.
Focus: Demonstrates emergence, not decidability.
Limitation: Stays in the domain of physical and mathematical systems; doesn’t formalize social institutions or law.
Contrast: Where Wolfram ends with computational irreducibility, Doolittle begins with it—treating human cognition and cooperation as an attempt to manage it via constructive decidability using operational logic and adversarial testing of testimony.
Problem Solved: The absence of a universally commensurable system of measurement for behavior, cooperation, and law.
Method: Constructive logic from first principles of evolutionary computation, tested via testimonial adversarialism, formalized in ternary logic.
Contribution: Transforms the epistemic problem of measurement into an institutional and legal solution by producing a science of decidability.
Focus: Applies scientific rigor to truth, law, economics, and morality, where others fear to tread.
Unique Strength:
Doolittle resolves the demarcation problem not by logic alone, but by testifiability and the cost of variation from natural law.
Doolittle’s unites ethics, law, economics, and science under a single operational logic.
Doolittle’s method is both descriptive (explains natural law) and prescriptive (institutionalizes it).
Method: Constructive logic from first principles of evolutionary computation, tested via testimonial adversarialism, formalized in ternary logic.
Contribution: Transforms the epistemic problem of measurement into an institutional and legal solution by producing a science of decidability.
Focus: Applies scientific rigor to truth, law, economics, and morality, where others fear to tread.
Unique Strength:
Doolittle resolves the demarcation problem not by logic alone, but by testifiability and the cost of variation from natural law.
Doolittle’s unites ethics, law, economics, and science under a single operational logic.
Doolittle’s method is both descriptive (explains natural law) and prescriptive (institutionalizes it).
Comparative Matrix
Summary:
Gödel says: You can’t prove everything, even if it’s true.
Chaitin says: You can’t compress everything, some truths are incompressibly random.
Wolfram says: You can’t always reduce everything—many systems are computationally irreducible.
Doolittle says: True—but if we start from the Ternary logic of Evolutionary Computation to identify the patterns of emergence in the universe, followed by the physical limits of cooperation and testify operationally, we can produce decidability sufficient for truthful law, moral action, and institutional design, and warranty that testimony using adversarialism.
Gödel says: You can’t prove everything, even if it’s true.
Chaitin says: You can’t compress everything, some truths are incompressibly random.
Wolfram says: You can’t always reduce everything—many systems are computationally irreducible.
Doolittle says: True—but if we start from the Ternary logic of Evolutionary Computation to identify the patterns of emergence in the universe, followed by the physical limits of cooperation and testify operationally, we can produce decidability sufficient for truthful law, moral action, and institutional design, and warranty that testimony using adversarialism.
Doolittle acknowledges all their contributions as setting boundaries on justificationary knowledge, while he creates a constructive, operational, testifiable method to act within those boundaries — especially for the domains they avoided: law, ethics, and cooperation.
[END]
Source date (UTC): 2025-03-26 20:04:24 UTC
Original post: https://x.com/i/articles/1904987823956222156