Algorithmic thinking in Babylonian planetary theory

This paper investigates the parallels between modern algorithmic paradigms and ancient computational methods in Babylonian Mathematical Astronomy (BMA). Through analysis of procedure texts and planetary tables, it demonstrates that Babylonian astronomers employed systematic techniques resembling sequential execution, conditional branching, and procedure calls, while also anticipating higher-level structures such as iteration, recursion, and dynamic programming. Although expressed in Akkadian and Sumerian rather than formal code, these procedures exhibit modularity, abstraction, and control flow structures recognizable to computer scientists. Rather than treating algorithmic paradigms as either present or absent, the study situates Babylonian techniques along a spectrum, revealing both parallels and divergences with modern computer science, while also respecting the cultural and philological specificity of Babylonian sources. This study thus positions Babylonian planetary theory as an early manifestation of algorithmic reasoning, contributing both to the history of computation and to contemporary reflections on the universality of algorithmic thinking.