anandijain

4 ms·

1.
by anandijain 7mo ago
This is cool! I've always wanted a polished kernel on the terminal. I spent a lot of time a few years ago writing my own Wolfram Kernel. It was a blast to understand how a pattern matching (symbolic) language is implemented. https:&#x
2.
by anandijain 2y ago
just sent u an email and yeah I ditched the m expr parser and just made the dumbest parser I could haha
3.
by anandijain 2y ago
that's awesome, I wrote a Mathematica clone too! I think it's one of the most rewarding projects I've done. The amazing thing is how Mathematica starts working with just a few simple ideas, evaluator, backtracking pattern mat
4.
by anandijain 2y ago
Great yeah, that's awesome. Here's the code to cas3.rs https://github.com/anandijain/cas3.rs Edit: I actually rewrote it to https://github.com/anandijain/cas8.rs to have Exprs be referen
5.
by anandijain 2y ago
that's awesome! I wrote a Mathematica like cas about a year ago and it was definitely one of the most rewarding projects I've worked on. I didn't get to look too deep into the source. Do symbols in openbirch self evaluate lik
6.
by anandijain 2y ago
A bit unrelated but you posted oeis so hoping you know. In the article they mention there are 17 trillion possible 5-2 turing machines. I tried finding the sequence for this but couldn't. I found this https://oeis.org/A
7.
by anandijain 3y ago
In case you want a table format that shows the nearest ones in a list, I built https://free2pee.github.io/free2pee/ on top of OSM
8.
by anandijain 3y ago
I built something too, uses OpenStreetMap and has a catalog of ~400,000 bathrooms. https://free2pee.github.io/free2pee/