I agree when we speak about algorithms. When we speak about specific implementations it's useles most often, because most of these implementations use datatype

I agree when we speak about algorithms. When we speak about specific implementations it's useles most often, because most of these implementations use datatypes that simply don't work for numbers bigger than 2^64, collections that can hold at most 2^64 items etc. So your program can sort collections of at most 2^64 items in n log n? Nice, I can do that in constant time.