Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Probability and plurality for aggregations of learning machines
Information and Computation
Probabilistic inductive inference
Journal of the ACM (JACM)
Towards a mathematical theory of machine discovery from facts
Theoretical Computer Science - Special issue on algorithmic learning theory
On the intrinsic complexity of learning
Information and Computation
On the impact of forgetting on learning machines
Journal of the ACM (JACM)
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Inductive Inference: Theory and Methods
ACM Computing Surveys (CSUR)
Quantum automata and quantum grammars
Theoretical Computer Science
Dense quantum coding and quantum finite automata
Journal of the ACM (JACM)
Characterizations of 1-Way Quantum Finite Automata
SIAM Journal on Computing
Memory Limited Inductive Inference Machines
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Inductive Inference of Recursive Functions: Qualitative Theory
Baltic Computer Science, Selected Papers
On the power of quantum finite state automata
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
1-way quantum finite automata: strengths, weaknesses and generalizations
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Optimal Lower Bounds for Quantum Automata and Random Access Codes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Quantum versus Classical Learnability
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Probabilities to accept languages by quantum finite automata
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Languages recognizable by quantum finite automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
| Hi-index | 5.23 |
Freivalds and Smith [R. Freivalds, C.H. Smith Memory limited inductive inference machines, Springer Lecture Notes in Computer Science 621 (1992) 19-29] proved that probabilistic limited memory inductive inference machines can learn with probability 1 certain classes of total recursive functions, which cannot be learned by deterministic limited memory inductive inference machines. We introduce quantum limited memory inductive inference machines as quantum finite automata acting as inductive inference machines. These machines, we show, can learn classes of total recursive functions not learnable by any deterministic, nor even by probabilistic, limited memory inductive inference machines.