For one practical example, Gödel's incompleteness is directly related to decidability problems in CS. there's this glorious liar paradox machine discussed by Co

For one practical example, Gödel's incompleteness is directly related to decidability problems in CS. there's this glorious liar paradox machine discussed by Computerphile [0]. [0] https://www.youtube.com/watch?v=macM_MtS_w4 https://www.youtube.com/watch?v=macM_MtS_w4