4 ms·
The deterministic state of a computation block (aka, a computer) is 2^N where N is the total number of state-retaining elements plus inputs. Large portions of t
by sbf501 4y ago
The deterministic state of a computation block (aka, a computer) is 2^N where N is the total number of state-retaining elements plus inputs. Large portions of this space are inaccessible due to mutex conditions (e.g., two or more conditions that cannot be true at the same time).
How does an open curve on the edge of an N-dimensional hypercube (snake in the box, as you provided) describe the state of my computer? Your link said nothing about that.
- david_allison 4y agoApologies, the link was intended to go to the image of the hypercube + binary representation (which is much more intuitive than the images Wikipedia displays on the hypercube page), but it failed on mobile: https://upload.wikimedia.org/wikipedia/commons/2/2c/Snake_in_the_box.svg https://upload.wikimedia.org/wikipedia/commons/2/2c/Snake_in... The Gray Code image is a lot more 'practical' from an engineering perspective, but I don't feel it's of the same quality: https://upload.wikimedia.org/wikipedia/commons/c/c2/Gray_code_tesseract.svg https://upload.wikimedia.org/wikipedia/commons/c/c2/Gray_cod...