Selection of Multiple Solution Problems through Inhibition (Sum-of-Subsets)

摘要

The work illustrated in this paper is a foot step forward towards the objective set to mimic biological functions of a human brain. Our previous work tested the neural theory of "Neural Darwinism: Selection" using the optimization problem of 0/1 Knapsack [KP]. The present work has tested the above theory through multiple solution problems of sum-of-subsets. Further this work proves that such problems are easier to the human brain rather than optimization problems. This was possible by imitating the process of inhibition by a human brain. It is observed that the process of inhibition reduces the complexity of the problem in average case scenarios. This work is depicted through implementation of sum-of-subsets problem using three methods namely, Exhaustive Search, Inhibition as an integral function and Inhibition as an independent process. These approaches in the order of their implementation prove how such problems are made easier by human brains compared to optimization problems, which need exhaustive search.