K is bounded at most to whatever number of instructions the…

Twetch ·

K is bounded at most to whatever number of instructions there are (ie: a sufficient constant C)

So we can simplify in Big-O to just O(n).

All programs grow in O(n) where n is the program length.