Journal of Computer and System Sciences
Theoretical Computer Science
Randomness and universal machines
Journal of Complexity
Journal of Complexity
Effective Randomness for Computable Probability Measures
Electronic Notes in Theoretical Computer Science (ENTCS)
Natural halting probabilities, partial randomness, and zeta functions
Information and Computation
Probability and Program-Size for Functions
Fundamenta Informaticae
Undecidability of the structure of the Solovay degrees of c.e. reals
Journal of Computer and System Sciences
Random reals à la Chaitin with or without prefix-freeness
Theoretical Computer Science
A Characterization of Constructive Dimension
Electronic Notes in Theoretical Computer Science (ENTCS)
Andrzej Grzegorczyk's Contribution to Computer Science
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
A Hierarchy of Computably Enumerable Reals
Fundamenta Informaticae
Turing degrees of reals of positive effective packing dimension
Information Processing Letters
K-Trivial Closed Sets and Continuous Functions
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Algorithmically Independent Sequences
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Fixed Point Theorems on Partial Randomness
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Non-cupping, measure and computably enumerable splittings
Mathematical Structures in Computer Science
On universal computably enumerable prefix codes
Mathematical Structures in Computer Science
Complexity Oscillations in Random Reals
IEICE - Transactions on Information and Systems
Structures of Some Strong Reducibilities
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Chaitin Ω Numbers and Halting Problems
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Comparing notions of randomness
Theoretical Computer Science
A Note On the Turing Degrees of Divergence Bounded Computable Reals
Electronic Notes in Theoretical Computer Science (ENTCS)
Algorithmically independent sequences
Information and Computation
Kolmogorov-Loveland stochasticity and Kolmogorov complexity
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Counting dependent and independent strings
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Impossibility of independence amplification in Kolmogorov complexity theory
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Simplicity via provability for universal prefix-free Turing machines
Theoretical Computer Science
SIGACT news complexity theory column 68
ACM SIGACT News
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
UC'11 Proceedings of the 10th international conference on Unconventional computation
Kolmogorov complexity of initial segments of sequences and arithmetical definability
Theoretical Computer Science
Theoretical Computer Science
Constructive dimension and Hausdorff dimension: the case of exact dimension
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Functions that preserve p-randomness
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Towards an axiomatic system for Kolmogorov complexity
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
On the number of infinite sequences with trivial initial segment complexity
Theoretical Computer Science
Constructive equivalence relations on computable probability measures
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Solovay reducibility on d-c.e real numbers
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Lowness for weakly 1-generic and kurtz-random
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
How to build a probability-free casino
Information and Computation
Algorithmic randomness, quantum physics, and incompleteness
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
A Chaitin $$\Upomega$$ number based on compressible strings
Natural Computing: an international journal
Effectively approximating measurable sets by open sets
Theoretical Computer Science
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
On the turing degrees of divergence bounded computable reals
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Presentations of K-trivial reals and kolmogorov complexity
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
On oscillation-free chaitin h-random sequences
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
Symmetry of information: a closer look
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
A K-trivial set which is not jump traceable at certain orders
Information Processing Letters
Arithmetic complexity via effective names for random sequences
ACM Transactions on Computational Logic (TOCL)
Process and truth-table characterisations of randomness
Theoretical Computer Science
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Complexity of complexity and maximal plain versus prefix-free kolmogorov complexity
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A Hierarchy of Computably Enumerable Reals
Fundamenta Informaticae
Curiouser and curiouser: the link between incompressibility and complexity
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Turing's normal numbers: towards randomness
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Randomness, computation and mathematics
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Effective strong nullness and effectively closed sets
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
How much randomness is needed for statistics?
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Relative randomness for martin-löf random sets
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
A correspondence principle for exact constructive dimension
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Andrzej Grzegorczyk's Contribution to Computer Science
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Probability and Program-Size for Functions
Fundamenta Informaticae
Strong reductions in effective randomness
Theoretical Computer Science
Lowness for bounded randomness
Theoretical Computer Science
Reconciling data compression and kolmogorov complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Bounded computable enumerability and hierarchy of computably enumerable reals
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Mathematical Structures in Computer Science
Analogues of Chaitin's Omega in the computably enumerable sets
Information Processing Letters
Journal of the ACM (JACM)
Base invariance of feasible dimension
Information Processing Letters
Turing patterns with Turing machines: emergence and low-level structure formation
Natural Computing: an international journal
Program extraction for 2-random reals
Archive for Mathematical Logic
Functions that preserve p-randomness
Information and Computation
Traces, traceability, and lattices of traces under the set theoretic inclusion
Archive for Mathematical Logic
Universal computably enumerable sets and initial segment prefix-free complexity
Information and Computation
Initial segment complexities of randomness notions
Information and Computation
Archive for Mathematical Logic
| Hi-index | 0.01 |