193 karma · joined October 3, 2023
No one in the future will need to know the history of a particular ascii encoded blank space (among a whole file of ASCII encoded blank spaces). Anyone who needs the general info that the file needs to be ascii will be helped by it being somewhere else, as opposed to in a random commit message.
If you simply want to comment the current state of the code, you should add a comment in the code.
No one will ever need to know in the future why that particular space character is an ascii space, so the whole commit message is just a blog entry in the wrong place.
It would have made sense to just put a comment at the top of the file saying "make sure encoding is whatever".
Embarrassing that the Ig Nobel prize has so little understanding of what valid science is. The awarders seem to be motivated by chasing the approval of very ignorant and biased people in the general public and the media.
Neither the time value of money nor the cost of trading explain these dislocations.
Do those first four steps. You wouldn't (necessarily) cover every black point in your rectangle. Choose a remaining black point and flood fill from that, say green. Keep on doing this with different colours until you've covered every black point in your rectangle. You have a bunch of regions of different colours.
Now, if the different coloured regions are all nicely separate, then your set is locally connected. Because each point is either cleanly in one component or cleanly in the other.
If on the other hand your drawing looks like https://commons.m.wikimedia.org/wiki/File:Julia_set_for_the_... with mixed up boundaries where some points are infinitesimally close to more than one colour, then it's not locally connected.
The difficulty with intuition is that in our intuition, coloured regions always have reasonable boundaries (think countries in a map: the border can be wiggly but there's never infinitely many tiny bits of one country mixed up in the boundary of two others). In fractal geometry, things like the Newton fractal picture above are quite usual.
Strictly speaking, you would do this coloring with all connected components of the intersection of your rectangle and M. (And the rectangle could be any region.)
The example messes this up, although it is a correct example, the square on the diagram showing the local piece containing non-connected parts is wrong. The comb has more and more teeth, infinitely many in a bounded space, on the left side. Only a rectangle which includes the left edge properly shows why the set isn't locally connected. The rectangle pictured includes finitely many teeth which have a separation between them. A rectangle overlapping the left edge of the comb would include separate components which get arbitrarily close to that left edge and so can't be separated by a border.
If helium balloons cost $100 each vastly fewer of them would be sold. If they cost $100 but you could get $90 back by bringing them back to the store for the helium to be recycled, much less helium would be consumed.
If there is a limited supply of helium for essential medical use, the price should rise until either demand is affected or less of it gets discarded by hydrocarbon extractors. If this doesn't happen we are probably ok.
Stone Age people painted the animals they were going to hunt on rocks so that the pictures would entrap the animals' spirit and they would be easier to catch. This method of ensuring a good hunt was not effective so why did they do so many paintings?
I would be very surprised if you can find any reference at all to the number you describe as 'evidence bits', or anything equivalent, made by anyone who can show an understanding of basic probability, statistics, or information theory.
I understand how you get 20,000,000 as the answer to the calculation you carry out. My point is that that number is not meaningful in any way.
The elements which are between 'hand' and 'tail' are going to stay there for a long time, until the hand pointer cycles. If there are lots of elements which get put in the cache but don't really deserve it, that could take a long time. But that's exactly the case where you wouldn't want to keep the elements behind the hand around for a long time. Remember, they got 'promoted' for appearing twice in around the cache size records. Not a great indication that they should be kept for a long time. On the other hand, when the pointer cycles, they could get thrown away quite easily.
On the other hand CLOCK converges to a situation where elements which have appeared a lot are at the front. They are much less likely to be thrown out even if they have a temporary run of scarcity. The elements which don't appear much quickly bubble to the back and become much more likely to be thrown out in the next few evictions. This is accentuated if there are lots of elements which are getting hit relatively more frequently.
After a long time of running SIEVE, there's not really anything about the state which will improve future performance compared to when it starts cold. In many cases it seems it will be locked in to a suboptimal state by overadapting to past observations.
Or perhaps you can provide a reference to a justification of this type of calculation?
Going from 1:4 to 1:2 means that the event has become twice as likely. But going from 2:1 to 4:1 does not: it means that the complementary event has become half as likely.
Based on this, we can't do math with odds treating them identically to ratios.
If you do the math correctly, the two types of information measure are basically the same thing.