Re:Why databases use ordered indexes but programming uses ha...
by johncolanduoni on Tuesday December 10, 2019 @04:40AM
(#21751044)
A Turing machine can do constant-time arithmetric (or more simply, constant-time bound arithmetic) for operands of bounded size, as was suggested above.
I'd proposed a model in a sibling comment that seems to be the one most people use for analyzing algorithms.