Abstract
This expository work discusses the conventional oracle Turing machine model of recursive analysis and proposes an alternative one based on uniform Boolean circuit families. This replacement model is suitable for the study of both sequential and parallel computations. However, for the study of operators, even this model should be replaced by a more structured one based on uniform arithmetic circuit families.
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.
