David S. Kung
DAC 1998
We present a much more concrete version of algorithmic information theory in which one can actually run on a computer the algorithms in the proofs of a number of key information-theoretic incompleteness theorems. © 1996 Wiley Periodicals, Inc., a Wiley Company.
David S. Kung
DAC 1998
Oliver Bodemer
IBM J. Res. Dev
Thomas M. Cheng
IT Professional
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory