计算理论10_不可压缩性摘要.ppt

Outline Measuring Information ep213 cp 146 Measuring Information ep213 cp 140 Measuring Information ep213 cp 140 Regularity Regularity Allowed Descriptions 用Pi表示一长串01 Allowed Descriptions 用Pi表示一长串01 ‘Turing Describable’ ep215 cp141 ‘Turing Describable’ ep215 cp141 ‘Turing Describable’ ep215 cp141 Measuring the size of (M,y) Measuring the size of (M,y) An Encoding for M,y ep214, cp147思想 ：0,1和分隔符号，需三符号，可用三进位， 但这里巧用 二进位编码 Description Length of M,y Description Length of M,y Minimum Description x Descriptive Complexity of xK-kolmogolov , cp147 Descriptive Complexity of xK-kolm