Abstract
A presynaptic inhibition function is described based on the language of Boolean algebra. A Fibonacci neuron is adduced as the equivalent of the sequential composition of such functions. Effective implementations of logic circuits are proposed. Affine transformations of necessary arguments are determined by Walsh spectral representations. The complexity of switching neural networks with dual neurons is analyzed.
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.
