Is there a more intuitive proof of the halting problem's undecidability than diagonalization?
Channel: Roel Van de Paar
Date: 2021-02-05

Is there a more intuitive proof of the halting problem's undecidability than diagonalization?

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 Yuval Filmus (cs.stackexchange.com/users/683), user vzn (cs.stackexchange.com/users/699), user user118967 (cs.stackexchange.com/users/29807), user Luke Mathieson (cs.stackexchange.com/users/1636), user Ilmari Karonen (cs.stackexchange.com/users/1324), user cody (cs.stackexchange.com/users/988), user babou (cs.stackexchange.com/users/8321), and the Stack Exchange Network (cs.stackexchange.com/questions/42819). 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