Comparison between the complexity of a function and the complexity of its graph
Theoretical Computer Science
Coins, Quantum Measurements, and Turing's Barrier
Quantum Information Processing
Chaitin Ω numbers, Solovay machines, and Gödel incompleteness
Theoretical Computer Science
The Kolmogorov complexity of real numbers
Theoretical Computer Science
Presentations of computably enumerable reals
Theoretical Computer Science
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Algorithmic Information Theory and Cellular Automata Dynamics
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On the Construction of Effective Random Sets
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Randomness, Computability, and Density
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Prefix-Free Languages and Initial Segments of Computably Enumerable Degrees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
The Kolmogorov Complexity of Real Numbers
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Journal of Computer and System Sciences
Characterising the Martin-Löf random sequences using computably enumerable sets of measure one
Information Processing Letters
Another Example of Higher Order Randomness
Fundamenta Informaticae
Asymptotic Properties of the Factors of Words Over a Finite Alphabet
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Randomness and Determination, from Physics and Computing towards Biology
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Characterising the Martin-Löf random sequences using computably enumerable sets of measure one
Information Processing Letters
Abstract compositional analysis of iterated relations: a structural approach to complex state transition systems
Simplicity via provability for universal prefix-free Turing machines
Theoretical Computer Science
The very particular structure of the very hard instances
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A note on blum static complexity measures
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Randomness behaviour in blum universal static complexity spaces
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Randomness with Respect to the Signed-Digit Representation
Fundamenta Informaticae
Proving as a Computable Procedure
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Asymptotic Properties of the Factors of Words Over a Finite Alphabet
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Another Example of Higher Order Randomness
Fundamenta Informaticae
Computable Approximations of Reals: An Information-Theoretic Analysis
Fundamenta Informaticae
On countability, enumeration, and how to think like a computer scientist
Journal of Computing Sciences in Colleges
Hi-index | 0.01 |