Nanda Kambhatla
ACL 2004
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.
Nanda Kambhatla
ACL 2004
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
Elliot Linzer, M. Vetterli
Computing
Lixi Zhou, Jiaqing Chen, et al.
VLDB