Incompleteness, Complexity, Randomness and Beyond
Minds and Machines
Chaitin Ω numbers, Solovay machines, and Gödel incompleteness
Theoretical Computer Science
On the hierarchy and extension of monotonically computable real numbers
Journal of Complexity
Randomness and universal machines
Journal of Complexity
Classification of the Computable Approximations by Divergence Boundings
Electronic Notes in Theoretical Computer Science (ENTCS)
Natural halting probabilities, partial randomness, and zeta functions
Information and Computation
Undecidability of the structure of the Solovay degrees of c.e. reals
Journal of Computer and System Sciences
Universal Recursively Enumerable Sets of Strings
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Information: The Algorithmic Paradigm
Formal Theories of Information
Chaitin Ω Numbers and Halting Problems
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
A new representation of chaitin Ω number based on compressible strings
UC'10 Proceedings of the 9th international conference on Unconventional computation
Representation of left-computable ε-random reals
Journal of Computer and System Sciences
Universal recursively enumerable sets of strings
Theoretical Computer Science
Kolmogorov complexity as a language
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
A computability theory of real numbers
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Solovay reducibility on d-c.e real numbers
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On approximating real-world halting problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
A Chaitin $$\Upomega$$ number based on compressible strings
Natural Computing: an international journal
A computability challenge: asymptotic bounds for error-correcting codes
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Phase transition between unidirectionality and bidirectionality
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Analogues of Chaitin's Omega in the computably enumerable sets
Information Processing Letters
| Hi-index | 5.23 |