On the Length of Programs for Computing Finite Binary Sequences
Journal of the ACM (JACM)
On the Length of Programs for Computing Finite Binary Sequences: statistical considerations
Journal of the ACM (JACM)
Computational Complexity and Probability Constructions
Journal of the ACM (JACM)
Information-Theoretic Limitations of Formal Systems
Journal of the ACM (JACM)
MATHEMATICAL LOGIC FOR COMPUTER SCIENTISTS
MATHEMATICAL LOGIC FOR COMPUTER SCIENTISTS
Investigations in the theory of descriptive complexity.
Investigations in the theory of descriptive complexity.
Computation: finite and infinite machines
Computation: finite and infinite machines
Perceptrons: An Introduction to Computational Geometry
Perceptrons: An Introduction to Computational Geometry
The extent and density of sequences within the minimal-program complexity hierarchies
Journal of Computer and System Sciences
Minimum times and memories needed to compute the values of a function
Journal of Computer and System Sciences
Universal codeword sets and representations of the integers
IEEE Transactions on Information Theory
Using algorithms as keys in stream ciphers
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
The RM-CELL vs. the earthquakes
ACM SIGART Bulletin
Thermodynamics of computation and information distance
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Proceedings of the 30th IEEE symposium on Foundations of computer science
Complex Properties of Grammars
Journal of the ACM (JACM)
Inductive Inference: Theory and Methods
ACM Computing Surveys (CSUR)
An overview of computational complexity
Communications of the ACM
Complexity Measures of Supervised Classification Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
A characterization of c.e. random reals
Theoretical Computer Science
Kolmogorov complexity and non-determnism
Theoretical Computer Science
An example of a computable absolutely normal number
Theoretical Computer Science
Incompleteness, Complexity, Randomness and Beyond
Minds and Machines
Chaitin Ω numbers, Solovay machines, and Gödel incompleteness
Theoretical Computer Science
The closure properties on real numbers under limits and computable operators
Theoretical Computer Science
Presentations of computably enumerable reals
Theoretical Computer Science
EMCL '01 Proceedings of the 12th European Conference on Machine Learning
Hierarchy of Monotonically Computable Real Numbers
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Gales and the Constructive Dimension of Individual Sequences
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Randomness, Computability, and Density
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Closure Properties of Real Number Classes under Limits and Computable Operators
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Characterizing the Software Development Process: A New Approach Based on Kolmogorov Complexity
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Synchronized Product of Linear Bounded Machines
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Random elements in effective topological spaces with measure
Information and Computation
Algorithmic analysis of irrational rotations in a single neuron model
Journal of Complexity
Code density optimization for embedded DSP processors using data compression techniques
ARVLSI '95 Proceedings of the 16th Conference on Advanced Research in VLSI (ARVLSI'95)
Fuzzy reasoning and the logics of uncertainty
MVL '76 Proceedings of the sixth international symposium on Multiple-valued logic
Exact and approximate membership testers
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Kraft storage and access for list implementations(Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On the hierarchy and extension of monotonically computable real numbers
Journal of Complexity
The dimensions of individual strings and sequences
Information and Computation
On the existence of a new family of Diophantine equations for Ω
Fundamenta Informaticae
Optimal Ordered Problem Solver
Machine Learning
Journal of Computer and System Sciences
Algorithmic complexity of recursive and inductive algorithms
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Theoretical Computer Science
Characterising the Martin-Löf random sequences using computably enumerable sets of measure one
Information Processing Letters
Kolmogorov Complexity for Possibly Infinite Computations
Journal of Logic, Language and Information
Predictability, Complexity, and Learning
Neural Computation
Kolmogorov complexities Kmax, Kmin on computable partially ordered sets
Theoretical Computer Science
Uniform test of algorithmic randomness over a general space
Theoretical Computer Science
Another Example of Higher Order Randomness
Fundamenta Informaticae
Randomness and universal machines
Journal of Complexity
Schnorr Trivial Reals: A construction
Electronic Notes in Theoretical Computer Science (ENTCS)
Natural halting probabilities, partial randomness, and zeta functions
Information and Computation
On generalized computable universal priors and their convergence
Theoretical Computer Science - Algorithmic learning theory
Very Simple Chaitin Machines for Concrete AIT
Fundamenta Informaticae
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
An overview of computational complexity
ACM Turing award lectures
Random reals à la Chaitin with or without prefix-freeness
Theoretical Computer Science
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)
Fixed Point Theorems on Partial Randomness
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
On universal transfer learning
Theoretical Computer Science
Information: The Algorithmic Paradigm
Formal Theories of Information
An embedded declarative data transformation language
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Chaitin Ω Numbers and Halting Problems
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Stationary algorithmic probability
Theoretical Computer Science
Algorithmic information theory
IBM Journal of Research and Development
Lowness Properties and Approximations of the Jump
Electronic Notes in Theoretical Computer Science (ENTCS)
Characterising the Martin-Löf random sequences using computably enumerable sets of measure one
Information Processing Letters
Algorithmically independent sequences
Information and Computation
Sequential predictions based on algorithmic complexity
Journal of Computer and System Sciences
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2
Causal inference using the algorithmic Markov condition
IEEE Transactions on Information Theory
On arithmetic computations with hereditarily finite sets, functions and types
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
A new representation of chaitin Ω number based on compressible strings
UC'10 Proceedings of the 9th international conference on Unconventional computation
Simplicity via provability for universal prefix-free Turing machines
Theoretical Computer Science
Representation of left-computable ε-random reals
Journal of Computer and System Sciences
Universal recursively enumerable sets of strings
Theoretical Computer Science
On the number of infinite sequences with trivial initial segment complexity
Theoretical Computer Science
A complexity based feature to support emergence in MAS
CEEMAS'05 Proceedings of the 4th international Central and Eastern European conference on Multi-Agent Systems and Applications
Prefix-Like complexities and computability in the limit
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Every sequence is decompressible from a random one
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Degrees of weakly computable reals
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
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
Prefix-Free and prefix-correct complexities with compound conditions
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Information-geometric approach to inferring causal directions
Artificial Intelligence
Presentations of K-trivial reals and kolmogorov complexity
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
A note on blum static complexity measures
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
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
A linearly computable measure of string complexity
Theoretical Computer Science
Randomness behaviour in blum universal static complexity spaces
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Turing's normal numbers: towards randomness
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
Probability and Program-Size for Functions
Fundamenta Informaticae
Very Simple Chaitin Machines for Concrete AIT
Fundamenta Informaticae
On the existence of a new family of Diophantine equations for Ω
Fundamenta Informaticae
Another Example of Higher Order Randomness
Fundamenta Informaticae
ProvSec'12 Proceedings of the 6th international conference on Provable Security
Introduction: computability of the physical
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Analogues of Chaitin's Omega in the computably enumerable sets
Information Processing Letters
Journal of the ACM (JACM)
2013 Special Issue: First experiments with PowerPlay
Neural Networks
On Potential Cognitive Abilities in the Machine Kingdom
Minds and Machines
Replacing Causal Faithfulness with Algorithmic Independence of Conditionals
Minds and Machines
Universal computably enumerable sets and initial segment prefix-free complexity
Information and Computation
Initial segment complexities of randomness notions
Information and Computation
| Hi-index | 0.11 |