How inefficient can a sort algorithm be?

TL;DR

This paper investigates the theoretical limits of sorting algorithms, establishing large lower bounds for a specific class and showing these bounds are constrained only by fundamental computability principles.

Contribution

It provides new lower bounds for a family of sorting algorithms and demonstrates their limitations are governed by basic computability constraints.

Findings

Large lower bounds for certain sorting algorithms

Bounds are limited only by computability arguments

Highlights fundamental limits of algorithm efficiency

Abstract

We find large lower bounds for a certain family of algorithms, and prove that such bounds are limited only by natural computability arguments.