Incompleteness, Complexity, Randomness and Beyond
Minds and Machines
A topological characterization of random sequences
Information Processing Letters
Topologies for the set of disjunctive ω-words
Acta Cybernetica
Natural halting probabilities, partial randomness, and zeta functions
Information and Computation
Proving as a Computable Procedure
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Very Simple Chaitin Machines for Concrete AIT
Fundamenta Informaticae
Probability and Program-Size for Functions
Fundamenta Informaticae
Entropy and algorithmic complexity in quantum information theory
Natural Computing: an international journal
Note: On the number of words containing the factor (aba)k
Discrete Applied Mathematics
The Kolmogorov complexity of infinite words
Theoretical Computer Science
Universal Intelligence: A Definition of Machine Intelligence
Minds and Machines
Universal Recursively Enumerable Sets of Strings
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Algorithmically Independent Sequences
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On Oscillation-free ε-random Sequences
Electronic Notes in Theoretical Computer Science (ENTCS)
On universal computably enumerable prefix codes
Mathematical Structures in Computer Science
Information: The Algorithmic Paradigm
Formal Theories of Information
Formal Proof: Reconciling Correctness and Understanding
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
Threshold properties of some periodic factors of words over a finite alphabet
Journal of Automata, Languages and Combinatorics
Algorithmically independent sequences
Information and Computation
The dynamics of cellular automata in shift-invariant topologies
DLT'07 Proceedings of the 11th international conference on Developments in language theory
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Quantum query algorithms for conjunctions
UC'10 Proceedings of the 9th international conference on Unconventional computation
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
Representation of left-computable ε-random reals
Journal of Computer and System Sciences
Universal recursively enumerable sets of strings
Theoretical Computer Science
UC'11 Proceedings of the 10th international conference on Unconventional computation
Theoretical Computer Science
Is there an elegant universal theory of prediction?
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
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
A program-size complexity measure for mathematical problems and conjectures
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
On degrees of randomness and genetic randomness
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Learning families of closed sets in matroids
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Invariance and universality of complexity
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
Fundamenta Informaticae
Probability and Program-Size for Functions
Fundamenta Informaticae
The complexity of Euler's integer partition theorem
Theoretical Computer Science
Very Simple Chaitin Machines for Concrete AIT
Fundamenta Informaticae
Inductive complexity of p versus NP problem
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Mathematical Structures in Computer Science
Incomputability in physics and biology
Mathematical Structures in Computer Science
Base invariance of feasible dimension
Information Processing Letters
Turing patterns with Turing machines: emergence and low-level structure formation
Natural Computing: an international journal
Initial segment complexities of randomness notions
Information and Computation
Hi-index | 0.00 |