Notebooks
Blog
Blogroll
About
Incoming
Reading

Combinatorics of note

2020-07-18

monte carlo
probabilistic algorithms
concurrency hell
pseudorandomness
stringology
compsci

Maybe related 🤷:

Quasi Monte Carlo
Monte Carlo optimisation
Monte Carlo gradient estimation
Random number generation
Algorithmic statistics

Algorithmic complexity and quasi monte carlo both consider combinatorial matters too.

Jörg Arndt’s Matters Computational

No comments yet. Why not leave one?

GitHub-flavored Markdown & a sane subset of HTML is supported.

Name

Website (optional)

Email (optional)

Fill in your email address if you want to get notified when someone replies to your comment. Your email address is safely stored with strong 256-bit AES encryption. You can unsubscribe from notification emails any time by following a link on the bottom of a reply notification email.

The Living Thing is a collection of the perpetually-in-progress learning notebooks of Dan MacKinlay.

All original opinions expressed here are my own and not the opinions of my clients, employers or anyone else. If you want to talk about stuff here, use the private contact form.
I may research your visits to this page using cookies, which helps me justify spending time on this project, but I encourage you to opt out of such tracking. If you would like to support my work you can tip me via Brave or other online means.

Made with and