I don&#x27;t think this is the reason the sorting machine can beat O(nlogn).  Just as any real sorting machine is limited in size, every real computer is limited as well.  Just as the machine can&#x27;t hold arbitrarily many (or arbitrarily large) sticks, your computer doesn&#x27;t have enough memory to hold arbitrarily many (or arbitrarily large) numbers.  Complexity theory is predicated on idealized computers (Turing machines with infinitely long tapes, or register machines able to hold infinitely large numbers).