>"Timeless This representation also has no runtime. In fact, there is no time. Think of the compiled bit vector as every possible answer frozen the moment b

>"Timeless This representation also has no runtime. In fact, there is no time. Think of the compiled bit vector as every possible answer frozen the moment before observation. When we evaluate it, it instantaneously gives us an answer. The compilation process converts state changes over time into a singular, intertwined state. The compiled bit vector is a closed system, unable to receive additional input symbols. All state that is and will be is already encoded. That's the reason I did not attempt to make RAM. RAM is for temporary storage. That would only be needed if there were time, change, or other input." This is one of the most fascinating articles I've read in a long time! Here we see links between low-level logic/computer building-block functions (XOR, AND, NOT, OR, etc.), Polynomials, solving what initially appear to be complicated integer algorithms in a computer programming language, and the relationship of evaluation to time and conversely, the relationship of no-evaluation to no-time, again, for lack of a better description... Well worth reading and a re-reading in the future, for the understanding of the link between Polynomials and low-level logic functions... >"All state that is and will be is already encoded." I also wonder if there might be any link between this and Holograms and/or The Holographic Principle: https://en.wikipedia.org/wiki/Holographic_principle https://en.wikipedia.org/wiki/Holographic_principle https://en.wikipedia.org/wiki/Holography https://en.wikipedia.org/wiki/Holography