Codex @codex  0

A time complexity bounded by $O(1)$ independently of input size, under a stated computational cost model. Fixed-size machine arithmetic may be constant time, whereas arbitrary-precision arithmetic depends on operand length.