Leonid A. Levin, “Randomness conservation inequalities; information and independence in mathematical theories”, Information and Control, 61:1 (1984), 15
B.A. Trakhtenbrot, “A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms”, IEEE Annals Hist. Comput., 6:4 (1984), 384
O. Goldreich, S. Goldwasser, S. Micali, 25th Annual Symposium onFoundations of Computer Science, 1984., 1984, 464
A. Muir, M. W. Warner, “The dynamics of symmetric nets”, Bull Math Biol, 45:5 (1983), 781
A. N. Kolmogorov, “Combinatorial foundations of information theory and the calculus of probabilities”, Russian Math. Surveys, 38:4 (1983), 29–40
M. Milgram, H. Atlan, “Probabilistic automata as a model for epigenesis of cellular networks”, Journal of Theoretical Biology, 103:4 (1983), 523
Péter Gács, “On the relation between descriptional complexity and algorithmic probability”, Theoretical Computer Science, 22:1-2 (1983), 71
Stuart A. Kurtz, “On the random oracle hypothesis”, Information and Control, 57:1 (1983), 40
A. N. Kolmogorov, Lecture Notes in Mathematics, 1021, Probability Theory and Mathematical Statistics, 1983, 1
J. P. Crutchfield, N. H. Packard, “Symbolic dynamics of one-dimensional maps: Entropies, finite precision, and noise”, Int J Theor Phys, 21:6-7 (1982), 433
Charles H. Bennett, “The thermodynamics of computation—a review”, Int J Theor Phys, 21:12 (1982), 905
Andrew C. Yao, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), 1982, 80
Peter Gács, “Exact Expressions for Some Randomness Tests”, Z Math Logik Grundlagen Math, 26:25-27 (1980), 385
Gary L. Peterson, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980), 1980, 86
J.M. Maciejowski, “Model discrimination using an algorithmic information criterion”, Automatica, 15:5 (1979), 579
Péter Gács, Lecture Notes in Computer Science, 67, Theoretical Computer Science 4th GI Conference, 1979, 124
A. A. Brudno, “The complexity of the trajectories of a dynamical system”, Russian Math. Surveys, 33:1 (1978), 197–198
R. Solomonoff, “Complexity-based induction systems: Comparisons and convergence theorems”, IEEE Trans. Inform. Theory, 24:4 (1978), 422
S. Leung-Yan-Cheong, T. Cover, “Some equivalences between Shannon entropy and Kolmogorov complexity”, IEEE Trans. Inform. Theory, 24:3 (1978), 331
Robert Daley, “On the inference of optimal descriptions”, Theoretical Computer Science, 4:3 (1977), 301

⋯