Binary Lambda Calculus and Combinatory Logic.” Sep 14, 2004. http://homepages. cwi.nl/ ∼ tromp/cl/LC.pdf [64] Tadaki, K. “Upper bound by Kolmogorov complexity for the probability (2003)

by John Tromp
Venue:in computable POVM measurement.” Proceedings of the 5th Conference on Real Numbers and Computers, RNC5
Citations:10 - 0 self

Documents Related by Co-Citation

325 Algorithmic information theory – G. J. Chaitin - 1977
6294 A mathematical theory of communication – C E Shannon - 1948
536 Three approaches to the quantitative definition of information – A N Kolmogorov - 1965
1724 An introduction to Kolmogorov Complexity and its Applications: Preface to the First Edition – Ming Li, Paul Vitanyi - 1997
742 Structure and Interpretation of Computer Programs – H Abelson, G J Sussman, J Sussman - 1985
332 A Theory of Program Size Formally Identical to Information Theory – Gregory J. Chaitin - 1975
521 A New Kind of Science – Stephen Wolfram - 2002
1198 On computable numbers, with an application to the Entscheidungsproblem – A Turing - 1937
1266 The C Programming Language – Dennis M. Ritchie - 1988