Abstract

This paper presents a neural network approach, based on high-order two-dimension temporal and dynamically clustering competitive activation mechanisms, to implement parallel searching algorithm and many other symbolic logic algorithms. This approach is superior in many respects to both the common sequential algorithms of symbolic logic and the common neural network used for optimization problems. Simulations of problem solving examples prove the effectiveness of the approach.

Full Text
Paper version not known

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 call

Disclaimer: 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.