A characterization of c.e. random reals
Theoretical Computer Science
Can a computer proof be elegant?
ACM SIGACT News
Incompleteness, Complexity, Randomness and Beyond
Minds and Machines
Is There a Nonrecursive Decidable Equational Theory?
Minds and Machines
Chaitin Ω numbers, Solovay machines, and Gödel incompleteness
Theoretical Computer Science
Practical Implications of New Results in Conservation of Optimizer Performance
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Entropic measures, Markov information sources and complexity
Applied Mathematics and Computation
Communications of the ACM - Software product line
Algorithmic complexity as a criterion of unsolvability
Theoretical Computer Science
Bernoulli's principle of insufficient reason and conservation of information in computer search
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
| Hi-index | 0.00 |