Abstract
Several problems involving the local structure of finite algebras are shown to be unsolvable by interpreting the halting problem of Turing machines. Specifically, these problems are to decide, given a finite algebra A, whether the type-set of the variety generated by A, which is a subset of {1,2,3,4,5}, omits 2, or 3, or 4, or 5, respectively.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.