離散數學›Ch2 關係與函數第 24 題/共 25 題
24. Countable Sets、Uncountable Sets、Cardinality
#LS-02-024中Countable SetsUncountable SetsCardinality
Suppose the set of "valuable" problems is V, where each problem can be considered by human beings, and there is a bijection between V and (real number). Suppose the set of all A.I. softwares is S, where each software can solve exactly one problem. Each software can be represented as a long binary string (machine code). Which of the following statement are true?
📄 中央110
▤完整推導請見《WH 資工筆記 · 離散數學》Ch2 關係與函數