Are there undecidable properties of non-turing-complete automata? (5 Solutions!!)
Channel: Roel Van de Paar
Date: 27/02/2021

Are there undecidable properties of non-turing-complete automata?

Helpful?  Please support me on Patreon: https://www.patreon.com/roelvandepaar

With thanks & praise to God, and with thanks to the many people who have made this project possible! | Content (except music & images) licensed under CC BY-SA https://meta.stackexchange.com/help/licensing | Music: https://www.bensound.com/licensing | Images: https://stocksnap.io/license & others | With thanks to user Raphael (cs.stackexchange.com/users/98), user Pal GD (cs.stackexchange.com/users/4249), user Kaveh (cs.stackexchange.com/users/41), user Hernan_eche (cs.stackexchange.com/users/1396), user Hendrik Jan (cs.stackexchange.com/users/4287), user David Lewis (cs.stackexchange.com/users/303), user Amelio Vazquez-Reina (cs.stackexchange.com/users/325), and the Stack Exchange Network (cs.stackexchange.com/questions/1697). Trademarks are property of their respective owners. Disclaimer: All information is provided "AS IS" without warranty of any kind. You are responsible for your own actions. Please contact me if anything is amiss at Roel D.OT VandePaar A.T gmail.com