Is it undecidable if the language of a given Turing Machine is the set of composite numbers?
Channel: Roel Van de Paar
Date: 2021-02-27

Computer Science: Is it undecidable if the language of a given Turing Machine is the set of composite numbers?

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 David Richerby (cs.stackexchange.com/users/9550), user Banach Tarski (cs.stackexchange.com/users/46799), and the Stack Exchange Network (cs.stackexchange.com/questions/62369). 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