György E. Révész
Theoretical Computer Science
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.
György E. Révész
Theoretical Computer Science
Hendrik F. Hamann
InterPACK 2013
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
Yigal Hoffner, Simon Field, et al.
EDOC 2004