Jan Reimann, Frank Stephan, Logic Colloquium '01, 2017, 369
Laurent Bienvenu, Rupert Hölzl, Christopher P. Porter, Paul Shafer, “Randomness and Semimeasures”, Notre Dame J. Formal Logic, 58:3 (2017)
Scott Garrabrant, Tsvi Benson-Tilsen, Andrew Critch, Nate Soares, Jessica Taylor, “A Formal Approach to the Problem of Logical Non-Omniscience”, Electron. Proc. Theor. Comput. Sci., 251 (2017), 221
F. Benatti, S. Khabbazi Oskouei, A. Shafiei Deh Abad, “Quantum Entropy and Complexity”, Open Syst. Inf. Dyn., 24:02 (2017), 1750005
Jaime A. Londoño, “An Approach of Randomness of a Sample Based on Its Weak Ergodic Limit”, Journal of Probability and Statistics, 2017 (2017), 1
J. Math. Sci. (N. Y.), 226:5 (2017), 667–693
Cristian S. Calude, Ludwig Staiger, Frank Stephan, “Finite state incompressible infinite sequences”, Information and Computation, 247 (2016), 23
Martin Hilbert, “Formal definitions of information and knowledge and their role in growth through structural change”, Structural Change and Economic Dynamics, 38 (2016), 69
Bakhadyr Khoussainov, Lecture Notes in Computer Science, 9537, Logical Foundations of Computer Science, 2016, 159
Domenico Maisto, Francesco Donnarumma, Giovanni Pezzulo, “Nonparametric Problem-Space Clustering: Learning Efficient Codes for Cognitive Control Tasks”, Entropy, 18:2 (2016), 61
Jason Teutsch, Marius Zimand, “A Brief on Short Descriptions”, SIGACT News, 47:1 (2016), 42
Sebastiaan A. Terwijn, The Frontiers Collection, The Challenge of Chance, 2016, 49
Sean D. Devine, “Understanding how replication processes can maintain systems away from equilibrium using Algorithmic Information Theory”, Biosystems, 140 (2016), 8
Tom F. Sterkenburg, “Solomonoff Prediction and Occam's Razor”, Philos. of Sci., 83:4 (2016), 459
Sanjay Jain, Frank Stephan, Jason Teutsch, “Closed left-r.e. sets”, COM, 6:1 (2016), 1
Daniil Ryabko, Lecture Notes in Computer Science, 9925, Algorithmic Learning Theory, 2016, 253
Mikhail Andreev, Akim Kumok, “The Sum 2 KM(x)−K(x) Over All Prefixes x of Some Binary Sequence Can be Infinite”, Theory Comput Syst, 2015
Winston Ewert, William A. Dembski, Robert J. Marks, “Measuring meaningful information in images: algorithmic specified complexity”, IET Computer Vision, 9:6 (2015), 884
Jason Teutsch, Marius Zimand, “On Approximate Decidability of Minimal Programs”, ACM Trans. Comput. Theory, 7:4 (2015), 1
Martin Hilbert, 2015 48th Hawaii International Conference on System Sciences, 2015, 3841

⋯