On the inductive inference of real valued functions
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
On the intrinsic complexity of learning recursive functions
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
ACM SIGSOFT Software Engineering Notes
UPSILON: universal programming system with incomplete lazy object notation
Fundamenta Informaticae
Learning by the process of elimination
Information and Computation
Universal computation with Watson-Crick DOL systems
Theoretical Computer Science
Category, Measure, Inductive Inference: A Triality Theorem and Its Applications
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
D0L System + Watson-Crick Complementarity = Universal Computation
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
The Non-Recursive Power of Erroneous Computation
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
On the intrinsic complexity of learning recursive functions
Information and Computation
Toward an intutive and interesting theory course: the first step of a road map
Journal of Computing Sciences in Colleges
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Learning recursive functions: A survey
Theoretical Computer Science
Constructive reduction: understanding uncomputability through programming
ACM SIGCSE Bulletin
On approximating real-world halting problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
UPSILON: Universal Programming System with Incomplete Lazy Object Notation
Fundamenta Informaticae
Hi-index | 0.00 |