Surreal Arithmetic, Lazily
arXiv:2604.178855.3h-index: 2
Predicted impact top 26% in DS · last 90 daysOriginality Synthesis-oriented
AI Analysis
For researchers and practitioners interested in combinatorial game theory or surreal numbers, this work offers a practical implementation improvement, though incremental.
The paper explores efficient implementation of Conway's surreal numbers and their arithmetic operations using lazy evaluation and recursive data structures, achieving considerable speedup.
Conway's surreal numbers were aptly named by Knuth. This note examines how far one can get towards implementing surreals and the arithmetic operations on them so that they execute efficiently. Lazy evaluation and recursive data structures yield a considerable speed up.