Incompleteness, Complexity, Randomness and Beyond
Minds and Machines
Chaitin Ω numbers, Solovay machines, and Gödel incompleteness
Theoretical Computer Science
Randomness, Computability, and Density
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Entropic measures, Markov information sources and complexity
Applied Mathematics and Computation
Journal of Computer and System Sciences
Natural halting probabilities, partial randomness, and zeta functions
Information and Computation
Information: The Algorithmic Paradigm
Formal Theories of Information
Abstract compositional analysis of iterated relations: a structural approach to complex state transition systems
Computing beyond the turing limit using the h systems
DNA'04 Proceedings of the 10th international conference on DNA computing
Presentations of K-trivial reals and kolmogorov complexity
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Computable Approximations of Reals: An Information-Theoretic Analysis
Fundamenta Informaticae
| Hi-index | 0.00 |