We consider the hierarchy of wait-free shared objects, and show that this hierarchy does not express the computational power of shared objects. We prove that there are objects that are classified high in the hierarchy, yet, they can not implement objects that are classified much lower in the hierarchy. Our main result is: for any two levels k ₁k ₂ in the hierarchy, there are shared objects X ₁ and X ₂ that belong to k ₁ and k ₂, respectively, such that X ₁ can not implement X ₂. (We allow the specifications of the shared objects to be non deterministic.) This result implies not only that the current definition of the wait-free hierarchy does not express the computational power of shared objects, but also that there is no other hierarchy that does.