The paper introduces several important notions such as uncountability and halting problem firstly,the fact is proved by contradiction that halting problem is impossible problem,and the same to other relative issues in computer is proved by reduction.
本文先介绍了不可数性和停机问题等重要概念,用反证法证明了停机问题是不可解的,并使用归约法对计算机中的相关问题的不可解性进行了证明。
