Viewing profile — SPACECADET3D

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…

Thanks for the clarification! Hyperreal sounds very useful for zero testing (at the moment I use ErrorPropagatingFloat for this, but it is fickle), I will play around with this in …

What is so awful about the license? Non-professionals can use it for free without core restrictions. Are you a professional?

Are you a hobbyist? If so, you can use all your cores for free. If you are a professional, there are also no core restrictions, but you have to get a paid license.

I saw this project before, nice work! What is your plan when it comes to the hard core algebra parts like multivariate polynomial factorization and cylindrical algebraic decomposit…

Nice, I will check this out in more detail later. I had a quick look at the benchmarks and it looks like you compare f64 hyperreal with numericas 128 bit implementation, which will…

Author of Symbolica here! If these packages work well for you, then just use them :) I don't have a lot of experience with using these tools, but the last time I tried the user exp…

Pure looks interesting! You can also use Symbolica in Rust, which also has operator overloading so it will look quite similar. At some point I will also add Julia bindings.

I used mermaid, which gets live-compiled on the website, that is built using quarto. Here is an example: ```{mermaid} flowchart LR A -- 1 --- B B -- 2 --- C B -- 8 --- E C -- 3 ---…

Author of the blog post here. I am happy to answer any questions about the article, pattern matching in general or about Symbolica!

It's not a language specific feature, but you can do the bookkeeping yourself. In the simplest form you can write: f(1,...)*f(2,...) Then when you do pattern matching with wildcard…

I am using GMP indeed, through the Rust crate `rug`.

You can also just use Expression.parse('x+f(x)+5') Of course, to refer to a specific variable of the CAS in Python, you need to bind it to a Python variable. There is no way around…

Thanks for the feedback! I will see if I can slow down the slideshow. You can see more demos in the docs and the live notebook. An expression is very general. Each variable and fun…

These polynomials appear when computing Feynman diagrams, which are used to make predictions for the Large Hadron Collider. The collider can measure collisions with such astonishin…

I've actually been a developer of FORM since my PhD (which I did with the author of FORM, Jos Vermaseren)! In Symbolica, I am taking the best features of FORM, while making it easi…

Most of these features are included in Symbolica in some capacity (ODE solving is missing) and there are CAS features Symbolica has and that Maxima has not (like advanced pattern m…

Symbolica is only a year old, however most features are already in there. What is a Sage feature you'd like to see in Symbolica? Note that there are also features in Symbolica that…

Thanks for reporting, I fixed the typo. I actually had an idea to do an OEM license check in build.rs that compiles out all license checks so that this version can be included in c…

I have updated the post. It's an annual site-wide license, so not per user.

Author of Symbolica here: Symbolica is used in physics calculations to do arithmetic on rational polynomials that are hundreds of megabytes long. For my physics research I have wor…

Author here: thanks for the feedback. I will add a price range soon. The reason why it is not there in the first place is because I am thinking about site-wide licenses, which are …

Author here: you can generate the Groebner basis in lex order or compute a resultant, but it doesn't automatically backsubstitute the system at the moment. This is mostly because I…

It depends on what you want to do. It should be much faster than Sympy and it is often much faster than Mathematica, for example if you do pattern matching or are manipulating rati…

One use case is in theoretical physics, where expressions that take up about a terabyte are generated when computing Feynman diagrams, but only in the intermediate stages. By the e…