Documentation
How to find a closed form from a numerical value
To identify a numerical constant, navigate to the calculator, enter your target decimal number (e.g., 3.14159), select the operations you expect in the formula, and start the search. The algorithm will exhaustively generate mathematical expressions and compare their evaluated values against your target.
What is K-Complexity?
In our inverse symbolic calculator, K-complexity (Kolmogorov-like complexity) represents the length or depth of the expression tree. A smaller K-complexity means a simpler formula (like π + 1). A higher K-complexity means deeper nesting and more operators (like sqrt(exp(π) / 2) + 1).
The algorithm searches breadth-first through K-complexity levels, ensuring that the shortest and simplest closed-form representations are found first.
CPU vs GPU Search
WebAssembly (CPU)
Ideal for low-complexity searches and general use. It runs parallel across your CPU cores directly in the browser. It accurately handles complex arithmetic and high precision.
WebGPU (Experimental)
Massive parallelization by offloading the brute-force generation to your graphics card. Suitable for very high K-complexity depths, functioning as a hyper-fast closed form finder.
Real vs Complex Numbers
The engine inherently supports complex number arithmetic during intermediate steps. Even if your target is a real number, the algorithm might traverse through complex space (using Euler's formula, for example) to arrive at the final real-valued formula.