The minimal number of layers of a perceptron that sorts

P.J. Zwietering, E.H.L. Aarts, J. Wessels

Research output: Contribution to journalArticleScientificpeer-review

2 Citations (Scopus)


In this paper we consider the problem of determining the minimal number of layers required by a multilayered perceptron for solving the problem of sorting a set of real-valued numbers. We discuss two formulations of the sorting problem; ABSSORT, which can be considered as the standard form of the sorting problem, and for which, given an array of numbers, a new array with the original numbers in ascending order is requested, and RELSORT, for which, given an array of numbers, one wants first to find the smallest number, and then for each number-except the largest-one wants to find the number that comes next in size. We show that, if one uses classical multilayered perceptrons with the hard-limiting response function, the minimal numbers of layers needed are 3 and 2 for solving ABSSORT and RELSORT, respectively.
Original languageEnglish
Pages (from-to)380-387
Number of pages8
JournalJournal of Parallel and Distributed Computing
Issue number3
Publication statusPublished - 1994
Externally publishedYes


Dive into the research topics of 'The minimal number of layers of a perceptron that sorts'. Together they form a unique fingerprint.

Cite this