Incompleteness, Complexity, Randomness and Beyond
Minds and Machines
Chaitin Ω numbers, Solovay machines, and Gödel incompleteness
Theoretical Computer Science
The Kolmogorov complexity of real numbers
Theoretical Computer Science
The Kolmogorov Complexity of Real Numbers
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Random elements in effective topological spaces with measure
Information and Computation
Uniform test of algorithmic randomness over a general space
Theoretical Computer Science
Computability and information in models of randomness and chaos†
Mathematical Structures in Computer Science
Computability of probability measures and Martin-Löf randomness over metric spaces
Information and Computation
Hi-index | 0.00 |