On an aspect of the undecidable problem

Abstract

계산가능한 함수들의 집합의 농도가 ???(자연수집합의 농도)임을 주지의 사실로서 소개하고, 계산 불가능한 함수들의 집합의 농도는 적어도 ??(연속체의 농도)와 같음을 증명해 보임으로서 idealized computer에서도 결정 불가능한 문제들이 결정 가능한(즉 계산 가능한)문제보다 훨씬 더 많이 있을 수 있다는 당연함을 보인 것이다.

This paper introduces the fact that cardinality of the set of computable functions is ??? and proves that cardinality of the set of non-computable functions is at least equal to ??(the cardinality of continuum).

By this proof, we can see a matter of course that there are more undecidable problems than decidable problems (that is, computable ones) in idealized computer.

This paper introduces the fact that cardinality of the set of computable functions is ??? and proves that cardinality of the set of non-computable functions is at least equal to ??(the cardinality of continuum).

By this proof, we can see a matter of course that there are more undecidable problems than decidable problems (that is, computable ones) in idealized computer.