Isn’t the most (time) efficient algorithm always a giant lookup table?
That approach doesn’t help an embedded observer much, if they find that they cannot determine the entries to the table—because of the uncertainty principle.
That approach doesn’t help an embedded observer much, if they find that they cannot determine the entries to the table—because of the uncertainty principle.