Real computers have bounded memory
On a machine with unbounded memory
- integers would need unbounded precision
- m+n would take O(log(|m|+|n|)) time
- claiming O(n) would be problematic
Once we fix a word size, we can treat addition as taking O(1) time
Therefore, distinguishing between O(n) and O(n log n) can be tricky