2025/10/17 by MohammadJavad Maarefvand, Maarefvand, MohammadJavad
Computer Science · #03D10 #12F10 #51M04 #Cellular Automata and Applications #Computability, Logic, AI Algorithms #FOS: Mathematics #History and Overview (math.HO) #History of Computing Technologies
paper · pdf · doi:10.48550/arxiv.2510.15858
openalex publication_date 2025/10/17 · openalex created_date 2025/10/21 · openalex updated_date 2026/07/28
This article explores the limits of geometric construction using various tools, both classical and modern. Starting with ruler and compass constructions, we examine how adding methods such as origami, marked rulers (neusis), conic sections, mechanical linkages, and certain transcendental curves expands the range of constructible numbers. These methods allow the construction of increasingly complex numbers from square roots, to cube roots, to all algebraic numbers, and in some cases to specific transcendental constants like pi and e. We explain how field theory gives a precise way to understand these constructions, and how computability theory shows that no finite geometric method can produce every computable number. In particular, no construction process that can be described step by step can reach uncomputable numbers. The article concludes by presenting a hierarchy of geometric methods, showing how each step increases what is possible, while still leaving strict theoretical limits in place.