Quantitative and qualitative information in computations

Robert P. Daley
1980 Information and Control  
In this paper two notions of information content for the characteristic sequences of sets are compared. One is the minimal-program complexity of the sequences and represents a quantitative information content, and the other is the degree of unsolvability of the underlying set and represents a qualitative information content. The major conclusion from this work is that with few exceptions these measures of information content are unrelated. Various tradeotis between these measures are also demonstrated.
doi:10.1016/s0019-9958(80)90615-4 fatcat:f62popptmjfcpprgkjlh6njg4u