Sorting with self-organizing maps.
A self-organizing feature map (Von der Malsburg 1973; Kohonen 1984) sorts n real numbers in O(n) time apparently violating the O(n log n) bound. Detailed analysis shows that the net takes advantage of the uniform distribution of the numbers and, in this case, sorting in O(n) is possible. There are, however, an exponentially small fraction of pathological distributions producing O(n2) sorting time. It is interesting to observe that standard learning produced a smart sorting algorithm.
Budinich
M
M
INFN, Trieste, Italy.
D000465:Algorithms; D001185:Artificial Intelligence; D016571:Neural Networks, Computer; D013997:Time Factors