Abstract
The main point in the design of content addressable memory would be under what conditions the state possessing the total information can attract all other states in the phase of the system. The problem can be formulated as a global asymptotic stability problem of Boolean dynamical systems. In this article we give a complete answer to this global asymptotic stability problem. The conditions employed involve the Hamming distance on the phase space {0,1}nas well as the spectral condition on the Jacobian Boolean matrix of F: {0,1}n→{0,1}n evaluated at each point of {0,1}n. This article furnishes a complete solution of the Boolean Markus–Yamabe problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
