CALLIOPE · BCOM

Inspired by Euclid and al-Khwarizmi, Ramon Llull (1232--1316) developed a combinatorial ``Art'' (Ars) intended as a universal method of reasoning expressed via letters and rotating figures. Gottfried Wilhelm Leibniz (1646--1716) engaged directly with Llull’s ideas in his Dissertatio de arte combinatoria (1666) and later formal work (binary arithmetic, the project of a characteristica universalis). In the 20th century, these combinatorial and representation-first ambitions connect conceptually to Algorithmic Information Theory (AIT)---Solomonoff’s universal induction (1964), Kolmogorov complexity (1965), Levin’s information conservation (1974), and Chaitin’s program-size complexity (1975). This note summarizes the lineage with compact, citable pointers. This brief places Ramon Llull in a longer lineage of computational/algorithmic thinking, from Aristotle and Euclid to al-Khwarizmi, Llull, Pascal, Leibniz, Babbage/Lovelace, Turing, Kolmogorov/Solomonoff/Chaitin, and contemporary AI and digital/“computational universe” proposals (Tegmark, Lloyd). It includes a compact Llull bio, a focused overview of Llull’s method and influence on Leibniz and AIT, and a TikZ figure summarizing the historical thread. Inline citations are clickable; a linked bibliography follows.

A scholarly reference note tracing the idea that reasoning can be mechanized — from Llull's spinning wheels to Kolmogorov's program-length complexity — with a linked bibliography for each step.

This is a reference/overview note, not a research paper with new results. It is explicitly described as a "concise scholarly overview with linked references," so the summary is proportionally short.

The core intuition is simple: for roughly 700 years, a recurring dream has been that thinking could be reduced to symbol manipulation — pick the right alphabet, the right rules, and truth follows mechanically. Llull (1232–1316) built rotating paper wheels that combined a fixed set of divine attributes to generate theological propositions. Leibniz (1666, 1703) read Llull, found the dream compelling, and tried to make it rigorous: his characteristica universalis would encode all concepts as symbols, and his calculus ratiocinator would settle disputes by calculation. Binary arithmetic was part of the same vision. Algorithmic Information Theory (AIT) — Solomonoff 1964, Kolmogorov 1965, Levin 1974, Chaitin 1975 — then gives the dream its sharpest mathematical form: the complexity of an object is the length of its shortest program, and a sequence is "random" precisely when no short program can reproduce it.

The bridge from Leibniz to AIT is not just metaphorical. Chaitin argues explicitly (2003, 2004) that Leibniz already had the key intuition: a good theory is one that compresses data, and data that resist compression are lawless. AIT makes this precise and provable. The note cites Chaitin's papers directly for this claim.

The paper also situates this lineage in a longer arc — Aristotle's syllogistic, Euclid's algorithm, al-Khwarizmi's algebra, Pascal's mechanical calculator, Babbage and Lovelace, Turing's formalization of computability, modern deep learning, and finally Tegmark's Mathematical Universe Hypothesis and Lloyd's "universe as quantum computation." These are presented as waypoints on a timeline, not as a tight argument. The source does not claim all these figures are equally connected; it frames them as a "thread of computational thought."

For BCOM purposes, the note flags that Llull is legitimately readable as a precursor to algorithmic search over a finitely generated hypothesis space — a framing relevant to anyone thinking about the conceptual prehistory of machine reasoning or the philosophy of induction.