High-precision numerical calculation
z = 0.51404189589007076139762973957688candidate = 5*pi^2/96A typical use case: a numerical integral or algebraic manipulation returns a decimal and the recognizer proposes a compact form.
Method notes
The calculator reverses the usual numerical workflow. Instead of entering a formula and obtaining a number, one enters a number and searches for short calculator programs that reproduce it.
Use the tool the way one uses a numerical experiment: record the input, the assumptions, the search parameters, and the candidate expression. The result is not a proof.
Use a value produced by a calculation, measurement, integral, sum, simulation, or exercise. Do not supply more digits than are meaningful.
When z is known only approximately, give an error estimate. Exact-looking decimal input can otherwise produce misleading overfitted formulas.
K bounds the length of the RPN button sequence. Each additional step increases the search space roughly by the calculator alphabet size.
A returned expression is a numerical lead. Recompute at higher precision or prove the identity from the original mathematical problem.
The search space is defined by a standard scientific RPN calculator. Button sequences are encoded as integer codes, then evaluated one after another. The original browser version describes this as a virtual calculator whose buttons are pressed sequentially by CPUs rather than randomly by people.
If the calculator alphabet has 36 buttons, increasing K by one multiplies the naive search space by about 36. Parallel CPU workers and WebGPU help, but the combinatorial growth remains the central limitation.
Candidate formulas should be judged by both numerical accuracy and complexity. Long formulas can fit many decimal inputs by accident.
| Symbol | Meaning |
|---|---|
| z | target numerical value |
| Delta z | absolute uncertainty of the input value |
| delta z | relative uncertainty Delta z / z |
| K | length of the RPN code being searched |
| RPN | reverse Polish notation button sequence |
| CR | compression-style ranking signal balancing error and length |
These examples are checks for numerical work and teaching: each one shows what was entered, what candidate was found, and what still has to be verified.
z = 0.51404189589007076139762973957688candidate = 5*pi^2/96A typical use case: a numerical integral or algebraic manipulation returns a decimal and the recognizer proposes a compact form.
z = 0.22222222222candidate = 2/9Useful for teaching why decimal representations can hide very simple exact values.
z = 0.846153846153846candidate = tanh(log(sqrt(12))) = 11/13An example of an identity that is not obvious from the decimal representation and can become a problem for students.
z = 2026candidate = 1 + (9*5)^2Integer and date-like inputs are not scientific evidence by themselves, but they are useful demonstrations of the search space.
Constant recognition is exploratory. A very close numerical match can still be meaningless if the expression is too long, if the input precision is overstated, or if the expression has no connection with the original problem.
If the tool contributes to a publication, cite the repository or deployed version and include the search parameters needed to reproduce the candidate.
Constant Recognition, A. Odrzywolek and K. Sroka. Inverse RPN calculator for numerical constant recognition. https://github.com/Klaudiusz321/ConstantRecognition1