Solving the serializability problem by a connectionist machine

The serializability problem, which is NP-complete, is to decide on the existence of a total order consistent with a given ordering constraint. A connectionist machine is proposed for finding an almost sure solution to the serializability problem such that a feasible final configuration implies that the set is serializable with the given ordering constraint. An infeasible final configuration does not mean that it is not serializable. Therefore, the machine is not able to recognize all the serializable constraints. The experiments show that the machine seems to converge to a stable configuration in polynomial time and the performance of the machine is quite high, i.e., for most of the time, it is able to find the correct answer.