A 13th-Century Enumeration Algorithm, Ignored for 700 Years

·Hacker News··

In Or ha-Sekhel, the Kabbalist Abraham Aboulafia prescribes a systematic way to run through every arrangement of the letters of a word. With only two or three simple rules, he describes what we would now call a recursive algorithm for generating permutations.

Read full article →

Related Articles

US–Indian space mission maps extreme subsidence in Mexico City
leopoldj · Hacker News · 3mo ago
Why are neural networks and cryptographic ciphers so similar? (2025)
jxmorris12 · Hacker News · 3mo ago
Every shape can be cut exactly in half with one straight line
bpx51 · Hacker News · 14h ago
Fun with polynomials and linear algebra; or, slight abstract nonsense
LolWolf · Hacker News · 3mo ago
The gauge broke: devs felt 20% faster with AI, measured 19% slower
intrepidkarthi · Hacker News · 1mo ago