On the random oracle hypothesis
Information and Control
Probabilistic inductive inference
Journal of the ACM (JACM)
Category and measure in complexity classes
SIAM Journal on Computing
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
The generic oracle hypothesis is false
Information Processing Letters
On the role of procrastination in machine learning
Information and Computation
The random oracle hypothesis is false
Journal of Computer and System Sciences
A recursive introduction to the theory of computation
A recursive introduction to the theory of computation
On the relative sizes of learnable sets
Theoretical Computer Science
The Power of Pluralism for Automatic Program Synthesis
Journal of the ACM (JACM)
Inductive Inference: Theory and Methods
ACM Computing Surveys (CSUR)
An Introduction to the General Theory of Algorithms
An Introduction to the General Theory of Algorithms
Measure, Category and Learning Theory
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
General Inductive Inference Types Based on Linearly-Ordered Sets
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Observations on Measure and Lowness for Delta^P_2
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Compressibility and Resource Bounded Measure
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
On the Complexity of Random Strings (Extended Abstract)
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Three Decades of Team Learning
AII '94 Proceedings of the 4th International Workshop on Analogical and Inductive Inference: Algorithmic Learning Theory
Inductive Inference of Recursive Functions: Qualitative Theory
Baltic Computer Science, Selected Papers
A note on genericity and bi-immunity
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Resource-bounded Baire category: a stronger approach
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
An excursion to the Kolmogorov random strings
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Generic oracles and oracle classes
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
On the size of sets of computable functions
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
| Hi-index | 0.00 |
The famous Sierpinski-Erd枚s Duality Theorem [Sie34b, Erd43] states, informally, that any theorem about effective measure 0 and/or first category sets is also true when all occurrences of "effective measure 0" are replaced by "first category" and vice versa. This powerful and nice result shows that "measure" and "category" are equally useful notions neither of which can be preferred to the other one when making formal the intuitive notion "almost all sets." Effective versions of measure and category are used in recursive function theory and related areas, and resource-bounded versions of the same notions are used in Theory of Computation. Again they are dual in the same sense.We show that in the world of recursive functions there is a third equipotent notion dual to both measure and category. This new notion is related to learnability (also known as inductive inference or identifiability). We use the term "triality" to describe this three-party duality.