Sure, if one ignores constraints then we can do everything. It's like saying that you could find an element in an unsorted array in O(1) if you just pick the right index. Obviously. The part that makes it hard is that you can't pick the right index. Coordination and resource allocation is everything. It's not free. It costs effort just like searching an unsorted array is O(n) worst case. There's no way to not pay the price. Energy has to be expended.

You'll see this if you're ever at sea. You have an infinite amount of fresh water around you. All you have to do is avoid the salt in it.