⚜ PRINCIPIA ORTHOGONA · Book XIV · Ch 7 ← Ch 3 · Book XIV contents · Ch 8 →
Book XIV · Chapter 7 · 2026-09-27 · Sanskrit and AI
LINGUISTICS · COMPUTATIONALLINGUISTICS · MATHEMATICAL

Maximum Meaning

What the NASA Sanskrit paper actually says
Warrantbook14/ch07-verify.py, 0 FAIL
SourceBriggs, AI Magazine 6(1), 1985
Readingcompression and unfolding: Pablo Nogueira Grossi
A widely shared story says NASA called Sanskrit the best language for computers. The paper behind it says something narrower and more interesting. Sanskrit grammarians built a way of analysing sentences that matches, triple for triple, what artificial intelligence was calling semantic networks in 1985. They wrote those analyses in a Sanskrit so compressed that it sometimes needed its own commentary.
1 · What the paper is

Briggs, NASA Ames, 1985

Rick Briggs wrote "Knowledge Representation in Sanskrit and Artificial Intelligence" at RIACS, a research institute at NASA Ames. It appeared in AI Magazine 6(1), Spring 1985, pp. 32–39. Its thesis is in the abstract: "a natural language can serve as an artificial language also", and "much work in AI has been reinventing a wheel millenia old" (p.32). Nowhere in its eight pages does it call Sanskrit the best language for computers. CITED

2 · Maximum meaning

Compressed, and then unfolded

Briggs describes the language of the grammarians as "a terse, very condensed form of Sanskrit, which paradoxically at times becomes so abstruse that a commentary is necessary to clarify it" (p.34). He says they wrote and talked "in a remarkably concise way" (p.36). Pāṇini's rules were "brief, algebraic formulations" (p.34). CITED

The same page shows the cost. Three words, graamam gacchati caitra ("Caitra goes to the village"), receive from the eighteenth-century grammarian Nāgeśa a paraphrase of 38 words: "There is an activity which leads to a connection-activity which has as Agent no one other than Caitra…". That is about thirteen times the length, and the paraphrase is where the meaning becomes explicit enough to reason with. COMPUTED

The series' reading This is the C → U pair of Chapter 3 in its oldest form. The sentence is the compressed core; the grammarian's paraphrase unfolds it until every role is named. Briggs names the trade-off himself: compression past a point needs a commentary. He also names the floor of decomposition: "The name ‘action’ cannot be applied to the solitary point reached by extreme subdivision" (p.35), which is a fold depth with a stopping rule. The mapping to C and U is ours (Pablo Nogueira Grossi's), not Briggs'. MODEL
3 · Why word order can be free

5,040 orders, one meaning

Briggs' central example is "Out of friendship, Maitra cooks rice for Devadatta in a pot, over a fire", in Sanskrit Maitraḥ sauhārdyāt Devadattāya odanam ghaṭe agninā pacati (p.38). Each noun carries its role in its ending, and the six roles are "Agent, Object, Instrument, Recipient, Point of Departure, Locality" (p.36). Word order, he says, "has usually no more than stylistic significance" (p.36). CITED

verbkāraka (role)wordEnglish
pacatiagentMaitrahMaitra
pacatiobjectodanamrice
pacatiinstrumentagninafire
pacatirecipientDevadattayafor Devadatta
pacatibecause-ofsauhardyatout of friendship
pacatilocalityghatein a pot

The script puts the seven words in all 5,040 possible orders. It reads each role from the word's ending, and every order returns the same six triples. English cannot do this: "Devadatta cooks rice for Maitra" swaps two roles without changing a single word form. The analyser is a toy that knows the endings of this one sentence and nothing else. COMPUTED

4 · Precise, not only short

Briggs does not claim that shortness alone made the language useful. Both traditions, he writes, encode "in a very clear, often apparently redundant way, in order to make the analysis accessible to inference" (p.38). The Sanskrit sentence is compressed, and the analysis of it is deliberately redundant. That is the same split this series draws between a statement and its proof. CITED

Not checked hereBriggs closes by crediting Indian thinkers with zero and the binary system "a thousand years before the West" (p.39); those are his claims, and Book XI ch 3 treats zero on its own sources. OPEN The Sanskrit is quoted in the article's own transliteration, without diacritics.
5 · A story that hides its mathematics

Malba Tahan and the thirty-five camels

In The Man Who Counted a traveller introduces himself: “My name is Beremiz Samir. I was born in the little village of Khoi, in Persia”. In chapter 3 he meets three brothers who have inherited thirty-five camels. By their father's will, “half of them belong to me”, says the eldest, one third to Hamed, “and one-ninth to Harim, the youngest”. Beremiz adds his companion's camel to the herd and divides thirty-six: 18, 12 and 4, “18 + 12 + 4 = 34 camels”. He returns the borrowed camel and keeps the last one: “The other rightly belongs to me for having resolved the complicated problem of the inheritance”. CITED

The whole trick is compressed into one fact: 1/2 + 1/3 + 1/9 = 17/18. The will never disposed of the last eighteenth of the herd. Every brother does better than the will allowed (18 > 17½, 12 > 11⅔, 4 > 3⅝), and the two camels left over are exactly the eighteenth of 36 that nobody was left. The script checks every herd up to 200. Lending one camel makes all three shares whole exactly when the herd is 17, 35, 53, …, one less than a multiple of 18, and then k = (N + 1)/18 camels are left over. With 17 the lender just gets his camel back. With 35, the storyteller earns one. COMPUTED

There is no Malba Tahan. That is the hoax. The Arab scholar on the cover, “Ali Iezid Izz-Edim Ibn Salim Hank Malba Tahan”, born near Mecca and said to have died fighting for the liberty of Bedouins, never existed. Every book under that name was written by Júlio César de Mello e Souza, a Brazilian schoolteacher of mathematics in Rio de Janeiro who never went to the Middle East and could not read Arabic. The hoax is still at work in the copy held here: the PDF names “MALBA TAHAN” as its only author and has no translator, no publisher and no real name, which the script checks. A reader of this file meets the invented man and nobody else. COMPUTED

The history comes from Alex Bellos (The Guardian, 9 May 2014). When Mello e Souza first offered stories to a newspaper under his own name, the editors did not read them. When he resubmitted the same stories as translations of an invented American author, “R. S. Slade”, they were published. Malba Tahan came next, supplied with a biography and the claim that Kipling had translated him into English. That claim ended the hoax eight years later, when a Brazilian Kipling scholar checked it. According to Bellos, the reveal did not hurt the books: the name stayed on more than a hundred titles and over two million copies, and many readers still take Malba Tahan for a real Arab author. CITED

The series' reading · after Pablo Nogueira Grossi

An author who does not exist was read, when the real one was not. The editors read the same text differently once it carried a different name. In Chapter 4's terms, the name worked as a translation key. It changed what the readers expected, and with that what they were willing to read, while the words stayed the same. The camel problem does the same thing in miniature: a fraction lesson is carried inside a Thousand and One Nights frame, and the frame decides whether anyone reads the lesson at all. Pablo brought this story to the series. MODEL

See also WP-116 · Akṣapāda Had the System (Nyāya logic), Chomsky and Chapter 3.

  1. R. Briggs, "Knowledge Representation in Sanskrit and Artificial Intelligence", AI Magazine 6(1) (1985) 32–39, doi:10.1609/aimag.v6i1.466. Held; hash in docs/floor-texts.tsv.
  2. Malba Tahan (J. C. de Mello e Souza), The Man Who Counted: A Collection of Mathematical Adventures, English translation; a 105-page PDF without front matter is held (themanwhocounted.pdf).
  3. A. Bellos, “Malba Tahan: the literary hoaxer who made Brazil love maths”, The Guardian, 9 May 2014. Read in the working session; not held as a file. WANTED