Comment on Is my cat Turing-complete?parentComments−k__4yAll operations are O(1)?−blamestross4ybusy 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.
Comments
All operations are O(1)?
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.