I read this with pleasure, right up until the bit about the ants. Then I saw the note from myself at the end, which I had totally forgot writing seven years ago. I probably first encountered the article via HN back then as well. Thanks for publishing my thoughts!
Readit Newsbrianberns commented on The most famous transcendental numbers sprott.physics.wisc.edu/p... · Posted by u/vismit2000
brianberns commented on Solving the NY Times "Pips" game with F# github.com/brianberns/Pip... · Posted by u/brianberns
Hey Brian, I really enjoyed reading your work on the Pips game! I found myself applying a similar backtracking algorithm to my Pythonic solution (https://github.com/ematth/pips). I focused on finding a single solution for each puzzle as opposed to all possible solutions. For hard puzzles with longer run times, I found that running multiple processes, each with the domino list shuffled, gets the solve time down to <15 seconds.
Thanks! I'm glad to see I'm not the only one who went down this rabbit hole. :)
I considered parallelizing my solution as well, but the problem is that it only gives a linear speedup, while the problem space increases exponentially. I decided to focus on pruning the search tree instead, and that seemed to work pretty well (after much thinking).
brianberns commented on Particle Lenia Deluxe Edition craftlinks.art/Notebook/p... · Posted by u/CraftingLinks
Particle Lenia is awesome. I did an online version that you can interact with here: https://brianberns.github.io/ParticleLenia/
I made a game out of creating proofs without words: https://brianberns.github.io/Tactix/
brianberns commented on OCaml's Wings for Machine Learning github.com/raven-ml/raven... · Posted by u/musha68k
Is anybody building things like this using FSharp? It seems like FSharp would have more of the ecosystem for machine learning and AI, than OCaml, yet with the functionality of OCaml.
Yes, I use F# with TorchSharp to do machine learning. My most recent project is a Hearts AI that is quite good. Here are some links:
* https://github.com/brianberns/Hearts
* https://github.com/brianberns/MinGptSharp
Huh, there must have been something in the water leading up to this.
Also from 1998 is this paper, "Calculus in coinductive form" and neither of these cites the other.
https://ieeexplore.ieee.org/document/705675
These are indeed very similar. Thanks for the link!
The math is a bit over my head, but this formulation seems more difficult than the one I'm familiar with. For example, x^2 is represented as 0::0::2 instead of 0::0::1 (because 2! = 2) and x^3 is represented as 0::0::0::6 instead of 0::0::0::1 (because 3! = 6). Is there a benefit to that?
This idea comes from a functional pearl called "Power Series, Power Serious" [0], which is well worth reading.
I implemented the same thing myself in F#. [1]
[0]: https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&d...
brianberns commented on Purely Functional Sliding Window Aggregation Algorithm byorgey.github.io/blog/po... · Posted by u/agnishom
I translated this to F# for my own edification. It's more verbose, but perhaps easier to understand for non-Haskellers.