4 ms·

All operations are O(1)?

• blamestross 5y ago
  busy beaver function of (a finite number) is hilariously big, but a constant. So there is a constant bound on the duration of all terminating programs using finite memory.