The Content-Addressable Memory Problem is one of the most famous in neural nets. This problem is recently settled by Shih-Tsai. In this thesis, we introduce the notion of the connection and give a different approach to some of results obtained in Shih-Tsai. We shall show that the nets will govern the fixed points base, the transient length, and the behavior of the dynamic equation.