Re:Symbolica 2.0: Programmable Symbols for Python and Rust
by SPACECADET3D on Monday June 08, 2026 @04:58PM
(#48451927)
In the end the zero test problem is undecidable for reasonably complicated expressions, so sadly there is no guarantee that you can rewrite one Computable into another even if they evaluate to the same. For polynomials you can do finite field evaluation tests to prove equality with a likelihood bound of your choosing. That may be interesting for hyperreal too.
Re:Symbolica 2.0: Programmable Symbols for Python and Rust
by timschmidt on Monday June 08, 2026 @05:17PM
(#48452243)
Yes. One of those problems with no neat solution, and worse no performant one. :)
You might find this bit of performance engineering interesting: https://github.com/timschmidt/hyperreal/blob/8a016808f4b0ba3...
The matrix math layer wanted that kind of optimization to avoid worst case operations.
It's still possible to approximate them both, and test them against each other, but since the whole architecture is built to reduce, avoid, and cache approximations because they're expensive, it's not the default.