Abstract
The work is devoted to the study of various classes of software circuits. type that implement Boolean functions, and the establishment of asymptotic estimates of Shannon functions for the complexity of implementing Boolean functions in schema classes. Models are introduced and explored reflexive-recursive schemes of functional elements and programs, in which recursive procedure calls are allowed. Influence is being explored the depth of recursion on the complexity of the implementation of the functions of the algebra of logic. For considered models, methods for the synthesis of schemes and programs are proposed, implementing arbitrary Boolean functions, as well as getting methods lower bounds for the Shannon function for the complexity of implementing Boolean functions, with the help of which, under certain restrictions, it was the asymptotic behavior of the corresponding Shannon functions is established.
Sign-in/Register to access full text options 
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.
