How inefficient can a sort algorithm be?
  We find large lower bounds for a certain family of algorithms, and prove that such bounds are limited only by natural computability arguments. 
Miguel A. Lerma
cs.DS