I find uncomputable numbers fascinating, especially that we somehow have computed a few busy beaver numbers given their supposedly uncomputability.<p>But conversely, I don't understand turing machines well enough to understand how inspecting one won't result in answering whether it halts or not.<p>Or put in another way: How does a simple Python program, that one cannot determine whether it halts or not, look?