G. Ramalingam
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.
G. Ramalingam
Theoretical Computer Science
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
Lixi Zhou, Jiaqing Chen, et al.
VLDB