Is the halting problem decidable by an "infinite Turing machine"? (2 Solutions!!)
Channel: Roel Van de Paar
Date: 2021-03-01

Is the halting problem decidable by an "infinite Turing machine"?

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 user56834 (cs.stackexchange.com/users/56687), user Stella Biderman (cs.stackexchange.com/users/42401), user SK19 (cs.stackexchange.com/users/82345), and the Stack Exchange Network (cs.stackexchange.com/questions/85134). 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