The Tautological Algorithm exists in a class of "ontology-oriented" algorithms, containing such algorithms as the Zen Sort, which sorts a list by deciding its current contents are the definition of "order" and therefore it is already sorted. Other algorithms in the class are asymptotically slower, however, clocking in at O(1), because it takes a nonzero amount of time to decide that the list is sorted. The Tautological Algorithm meanwhile by definition is already complete at the time it is used
@mcc this is very pretty.