how a computer stores negative numbers: the top bit has a negative weight, the rest as usual
Built as a memo rather than a table: the thing worth hanging it up for reads across the room, with the full reference in smaller type below it.
Three sizes in one archive — from a sheet on the fridge to a poster on the wall.
Bits are written from the most significant to the least. A shaded box is a one; a struck-through row is wrong.
Until recently the C and C++ standards allowed three ways to store negative numbers: two’s complement, ones’ complement and sign-magnitude. The last two each have two zeros, +0 and −0. C++20 (proposal P0907, JF Bastien) and C23 kept only two’s complement. Signed overflow, however, is still undefined behaviour: the wheel above shows what the processor does, not what the language promises.
Why the numbers can be trusted. Every countable number here is computed from data rather than typed in, and the sheet must pass 4 independent checks before it is allowed to build — how many items there are, the order they come in, and the claim in the highlighted box itself. If one fails, there is no file.
ten tasks, the year of each, the system, the figure — and the human it was measured against
all 128 positions: the column is the three high bits, the row is the four low ones
who published each standard, when, what it does to the sound, and how many bits per second it allows
forty bits to a quantum: five bytes, eight characters and five padding cases