Understanding Multiple Neighbourhood Cellular Automata
Multiple Neighborhood Cellular Automata (MNCA) produce complex and robust emergent structures not commonly seen in simpler models
The latest blog posts to take off on Hacker News. 163 posts.
Multiple Neighborhood Cellular Automata (MNCA) produce complex and robust emergent structures not commonly seen in simpler models
Stephen Wolfram considers if numbers are actually required, the use of symbolics and the potential for the growing role of computational irreducibility.
An unexpected paradigm journey into sleep sort
The Fourier Transform is one of the deepest insights ever made. Unfortunately, the meaning is buried within dense equations:
This is a followup to my previous post on the stack monoid, but is intended to be self-contained.
Modern AI systems approach tasks like recognising objects in images and predicting the 3D structure of proteins as a diligent student would prepare for an exam. By training on many example problems, they minimise their mistakes over time until they achieve success. But this is a solitary endeavour and only one of the…
Doga Tekin's website.
The only way to learn mathematics is to do mathematics—Paul Halmos Angie Hodge is an Associate Professor of mathematics at Northern Arizona University. Her interests as stated on her website …
Programming in logic can help you produce better optimized, more secure, bug-free code … if only you knew how to do it.
Using the power of randomness to answer scientific questions.
What3Words is a widely promoted system that is used for sharing a location using just three words. For example, ///wedge.drill.mess is located in Hyde Park.The globe is divided into 3m squares, eac…
Prime powers have a kinda chaotic pattern in their bits. We bootstrap this idea into a good random number generator, recapitulating history.
Blog post
The site of Sid
The European Commission just released their Proposal for a Regulation on a European approach for Artificial Intelligence . They finally get around to a definition of “AI” on page 60 of the report (link above):
In this article I’m trying to explain the difference/similarities between dynamic programing and divide and conquer approaches based on two examples - binary search and minimum edit distance (Levenshtein distance)
Our algorithm has the peculiar property that, roughly speaking, the longer the pattern is, the faster the algorithm goes. Furthermore, the algorithm is ``sublinear'' in the sense that it generally looks at fewer characters than it passes. The algorithm is described in
Once upon a time we were creatures in the wilderness and we evolved the ability to hear sounds. Now here's an interesting thing, if you hear a sound of frequency f and others of frequency 2f, 3f, etc then there's a good chance these sounds come from the same object, due to the physical principle of resonance . And so…
The notation [x] reigned for nearly two centuries before being replaced by ⌊x⌋. Why the latter is much better and what else we might learn from its inventor.
Or, “how not to GIS”.
<meta http-equiv=
Ensemble averages and time averages
Machine learning systems thrive on finding and exploiting statistical regularities. This is why they can't do causal reasoning.
The three-step framework Shopify's Data Science & Engineering team built for evaluating new search algorithms.
There’s not a whole lot on TLA+ technique out there: all the resources are either introductions or case studies. Good for people starting out, bad for people past that. I think we need to write more intermediate-level stuff, what Ben Kuhn calls Blub studies. Here’s an attempt at that. Most TLA+ properties are…
A blog about signals, programming, music, and other stuff.