Rusins Freivalds

Maksim Kravtsev

Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

Towards Axiomatic Basis of Inductive Inference.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

1999

On the Inductive Inference of Recursive Real-Valued Functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

The functions of finite support: a canonical learning problem.

[BibT_eX]

[DOI]

J. Exp. Theor. Artif. Intell., 1999

Inductive Inference with Procrastination: Back to Definitions.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1999

How to Simulate Free Will in a Computational Device.

[BibT_eX]

[DOI]

ACM Comput. Surv., 1999

Quantum Finite Multitape Automata.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999

Probabilities to Accept Languages by Quantum Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

On the Relative Sizes of Learnable Sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Identifying Nearly Minimal Gödel Numbers from Additional Information.

[BibT_eX]

[DOI]

Ognian Botuscharov

Ann. Math. Artif. Intell., 1998

Models of Computation, Riemann Hypothesis, and Classical Mathematics.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

Nonstochastic Languages as Projections of 2-Tape Quasideterministic Languages.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

A Logic of Discovery.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 1998

Closedness Properties in EX-Identification of Recursive Functions.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1997

Kolmogorov Numberings and Minimal Identification.

[BibT_eX]

[DOI]

Sanjay Jain

Theor. Comput. Sci., 1997

Tally Languages Accepted by Monte Carlo Pushdown Automata.

[BibT_eX]

[DOI]

Janis Kaneps

Dainis Geidmanis

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997

Weak and Strong Recognition by 2-way Randomized Automata.

[BibT_eX]

[DOI]

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1997

Learning Small Programs with Additional Information.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

Learning Formulae from Elementary Facts.

[BibT_eX]

[DOI]

Proceedings of the Computational Learning Theory, Third European Conference, 1997

Asymmetric Team Learning.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997

Team Learning as a Game.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

Effects of Kolmogorov Complexity Present in Inductive Inference as Well.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1996

On Duality in Learning and the Selection of Learning Terms.

[BibT_eX]

[DOI]

Inf. Comput., 1996

Learning with Confidence.

[BibT_eX]

[DOI]

Proceedings of the STACS 96, 1996

General Inductive Inference Types Based on Linearly-Ordered Sets.

[BibT_eX]

[DOI]

Proceedings of the STACS 96, 1996

Unions of identifiable families of languages.

[BibT_eX]

[DOI]

Proceedings of the Grammatical Inference: Learning Syntax from Sentences, 1996

Co-Learning of Recursive Languages from Positive Data.

[BibT_eX]

[DOI]

Thomas Zeugmann

Proceedings of the Perspectives of System Informatics, 1996

Transformations that Preserve Learnability.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 7th International Workshop, 1996

1995

How Inductive Inference Strategies Discover Their Errors

[BibT_eX]

[DOI]

Inf. Comput., May, 1995

On the Impact of Forgetting on Learning Machines.

[BibT_eX]

[DOI]

J. ACM, 1995

On the Intrinsic Complexity of Learning.

[BibT_eX]

[DOI]

Inf. Comput., 1995

Lower Time Bounds for Randomized Computation.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Measure, Category and Learning Theory.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Learning from Good Examples.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Error Detecting in Inductive Inference.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

Probabilistic versus Deterministic Memory Limited Learning.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, 1995

On the Inductive Inference of Real Valued Functions.

[BibT_eX]

[DOI]

Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

1994

An inductive inference approach to classification.

[BibT_eX]

[DOI]

Achim G. Hoffmann

J. Exp. Theor. Artif. Intell., 1994

Choosing a learning team: a topological approach.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Lower Space Bounds for Randomized Computation.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

Co-Learning of Total Recursive Functions.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

Co-learnability and FIN-identifiability of Enumerable Classes of Total Recursive Functions.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 1994

1993

On the Role of Procrastination in Machine Learning

[BibT_eX]

[DOI]

Inf. Comput., December, 1993

On the Power of Inductive Inference from Good Examples.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

On the impact of forgetting on learing machines.

[BibT_eX]

Bull. EATCS, 1993

On the Duality Between Mechanistic Learners and What it is They Learn.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 4th International Workshop, 1993

1992

Memory Limited Inductive Inference Machines.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1992

An Inductive Inference Appoach to Classification.

[BibT_eX]

[DOI]

Achim G. Hoffmann

Proceedings of the Analogical and Inductive Inference, 1992

Unions of Identifiable Classes of Total Recursive Functions.

[BibT_eX]

[DOI]

Proceedings of the Analogical and Inductive Inference, 1992

1991

Dual Types of Hypotheses in Inductive Inference.

[BibT_eX]

[DOI]

Proceedings of the Nonmonotonic and Inductive Logic, 1991

Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata.

[BibT_eX]

[DOI]

Janis Kaneps

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

Inductive Inference of Recursive Functions: Complexity Bounds.

[BibT_eX]

[DOI]

Karlis Podnieks

Proceedings of the Baltic Computer Science, Selected Papers, 1991

Complexity of Probabilistic Versus Deterministic Automata.

[BibT_eX]

[DOI]

Proceedings of the Baltic Computer Science, Selected Papers, 1991

Inductive Inference of Recursive Functions: Qualitative Theory.

[BibT_eX]

[DOI]

Proceedings of the Baltic Computer Science, Selected Papers, 1991

1990

Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines.

[BibT_eX]

[DOI]

Janis Kaneps

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Inductive Inference of Minimal Programs.

[BibT_eX]

[DOI]

Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

1989

Trade-Off among Parameters Effecting Inductive Inference

[BibT_eX]

[DOI]

Mahendran Velauthapillai

Inf. Comput., September, 1989

On the Power of Probabilistic Inductive Inference in Nonstandard Numberings.

[BibT_eX]

J. Inf. Process. Cybern., 1989

Inductive Inference up to Immune Sets.

[BibT_eX]

[DOI]

Juris Viksna

Proceedings of the Analogical and Inductive Inference, 1989

Inductive Inference from Good Examples.

[BibT_eX]

[DOI]

Proceedings of the Analogical and Inductive Inference, 1989

1988

Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings.

[BibT_eX]

[DOI]

Math. Log. Q., 1988

Sheffer and Symmetric Sheffer Boolean Functions under Various Functional Constructions.

[BibT_eX]

J. Inf. Process. Cybern., 1988

1986

Why Sometimes Probabilistic Algorithms Can Be More Effective.

[BibT_eX]

[DOI]

Farid M. Ablayev

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985

Recursiveness of the enumerating functions invreases the inferablity of recursively enumberable sets.

[BibT_eX]

Bull. EATCS, 1985

1984

On the Power of Probabilistic Strategies in Inductive Inference.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1984

Connections between Identifying Functionals, standardizing Operations, and Computable Numberings.

[BibT_eX]

[DOI]

Math. Log. Q., 1984

An answer to an open problem.

[BibT_eX]

Bull. EATCS, 1984

1983

Methods and Languages to Prove the Power of Probabilistic Machines.

[BibT_eX]

Proceedings of the Information Processing 83, 1983

Space and Reversal Complexity of Probabilistic One-Way Turing Machines.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1983

1982

Inductive Inference and Computable One-One Numberings.

[BibT_eX]

[DOI]

Math. Log. Q., 1982

1981

Projections of Languages Recognizable by Probabilistic and Alternating Finite Multitape Automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

Probabilistic Two-Way Machines.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1979

Fast Probabilistic Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1977

Probabilistic Machines Can Use Less Running Time.

[BibT_eX]