Re:A proof P = NP was accidentally published in TOCT
by hypertele-Xii on Tuesday July 20, 2021 @05:49AM
(#27891753)
> random access to an infinite, uncomputable sequence.
I.e. a (cryptographic) random number generator?
So we can construct approximations of it in the sense that we can create computers with varying, finite amounts of RAM. This might seem like a pedantic/obvious point to make, but it is actually also possible to design abstract computational machines that operate on truly infinite quantities, like a machine that has random access to an infinite, uncomputable sequence.
From a simplicity perspective, it also makes more sense to consider machines with an arbitrarily large amount of RAM (you can always hotplug more RAM), compared to setting some arbitrary limit because that is the most RAM we happen to be able to achieve in this universe.