I’m not sure I understand. I do explain what can be computed, don’t I?
> Something is said to be "computable" if there exists an algorithm that can get from the given input to the expected output. For example, adding together 2 integers is computable.
I could probably have dug into some of the restrictions, like how it has to be a finite number of steps.
This defines the term “computable”, but it doesn’t give you a sense of what things can be computed. Defining a term is entirely different from the above promise.
At the level you’re describing Turing machines, it’s also not clear that readers would have a precise notion of what an algorithm is. At no point (unless I missed it) do you explain that any algorithm is supposed to be implementable as a Turing machine, or the assumption of what is otherwise known as the Church–Turing thesis.
Oh loads, queueing has been around forever and there's an enormous amount of material on the topic. This post barely scratches the surface. One specific omission was an AQM strategy called "CoDel", which I'm expecting people to pick me up on.
Web components are just one method of componentising the visualisations. I'm steering clear of React/Vue/whatever other framework because I want these posts to still be relevant in 10 years. I'm not confident any existing frontend framework will be around 10 years from now, so decided to stick to web standards.
reply