The ismorphism conjecture fails relative to a random oracle
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The RM-CELL vs. the earthquakes
ACM SIGART Bulletin
Reliability, sampling, and algorithmic randomness
TAV4 Proceedings of the symposium on Testing, analysis, and verification
A maple program for proving hypergeometric identities
ACM SIGSAM Bulletin
Science, computational science, and computer science: at a crossroads
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Science, computational science, and computer science: at a crossroads
Communications of the ACM
The problem of survival from an algorithm point of view
Artificial Intelligence
A New Pattern Representation Scheme Using Data Compression
IEEE Transactions on Pattern Analysis and Machine Intelligence
Minds and Machines
Incompleteness, Complexity, Randomness and Beyond
Minds and Machines
How Gödel‘s Theorem Supports the Possibility of Machine Intelligence
Minds and Machines
Physics, Logic and the Phenomenal
Minds and Machines
Complexity, Fractal Dimension for Quantum States
Open Systems & Information Dynamics
A Kolmogorov complexity characterization of constructive Hausdorff dimension
Information Processing Letters
Chaitin Ω numbers, Solovay machines, and Gödel incompleteness
Theoretical Computer Science
CONTEXT '99 Proceedings of the Second International and Interdisciplinary Conference on Modeling and Using Context
Entropic measures, Markov information sources and complexity
Applied Mathematics and Computation
Quantum mechanics, mathematics, cognition and action
Journal of Logic, Language and Information
Do Logical Truths Carry Information?
Minds and Machines
A topological characterization of random sequences
Information Processing Letters
On the existence of a new family of Diophantine equations for Ω
Fundamenta Informaticae
Journal of Computer and System Sciences
Hypercomputation with quantum adiabatic processes
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Challenges for biologically-inspired computing
GECCO '05 Proceedings of the 7th annual workshop on Genetic and evolutionary computation
Another Example of Higher Order Randomness
Fundamenta Informaticae
Natural halting probabilities, partial randomness, and zeta functions
Information and Computation
A new methodology for quantifying the multi-scale similarity of images
Microelectronic Engineering
Very Simple Chaitin Machines for Concrete AIT
Fundamenta Informaticae
The Crystallizing Substochastic Sequential Machine Extractor: CrySSMEx
Neural Computation
On the behavioral diversity of random programs
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Algorithmic complexity as a criterion of unsolvability
Theoretical Computer Science
Random reals à la Chaitin with or without prefix-freeness
Theoretical Computer Science
Dynamics of a generic Brownian motion: Recursive aspects
Theoretical Computer Science
Computability and information in models of randomness and chaos†
Mathematical Structures in Computer Science
An Algebraic Characterization of the Halting Probability
Fundamenta Informaticae
The Halting Probability via Wang Tiles
Fundamenta Informaticae
Fixed Point Theorems on Partial Randomness
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
On universal computably enumerable prefix codes
Mathematical Structures in Computer Science
Philosophical Conceptions of Information
Formal Theories of Information
Information: The Algorithmic Paradigm
Formal Theories of Information
Computability of probability measures and Martin-Löf randomness over metric spaces
Information and Computation
Context-Aware Adaptation: A Case Study On Mathematical Notations
Information Systems Management
Fractals Generated by Algorithmically Random Brownian Motion
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
Stationary algorithmic probability
Theoretical Computer Science
Towards the validation of plagiarism detection tools by means of grammar evolution
IEEE Transactions on Evolutionary Computation
Abstract compositional analysis of iterated relations: a structural approach to complex state transition systems
Detecting visually similar Web pages: Application to phishing detection
ACM Transactions on Internet Technology (TOIT)
Algorithmic entropy, phase transition, and smart systems
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
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
A filter based feature selection approach using lempel ziv complexity
ISNN'11 Proceedings of the 8th international conference on Advances in neural networks - Volume Part II
Theoretical Computer Science
Information Sciences: an International Journal
ISBMDA'06 Proceedings of the 7th international conference on Biological and Medical Data Analysis
How can nature help us compute?
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
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
Hilbert's tenth problem and paradigms of computation
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
Lethargy results in LTI System Modelling
Automatica (Journal of IFAC)
Impugning Randomness, Convincingly
Studia Logica
Randomness behaviour in blum universal static complexity spaces
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
The Halting Probability via Wang Tiles
Fundamenta Informaticae
An Algebraic Characterization of the Halting Probability
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
PURE FLOW: gallery installation / mobile application
ACE'12 Proceedings of the 9th international conference on Advances in Computer Entertainment
Proceedings of the Winter Simulation Conference
Mathematical Structures in Computer Science
Proceedings of the Emerging M&S Applications in Industry & Academia / Modeling and Humanities Symposium
Project dynamics and emergent complexity
Computational & Mathematical Organization Theory
| Hi-index | 0.02 |