정지문제The machine halts if there are no possible transitions to followHalting : is undefinedLogically undecidable is first proven