Robert P. Daley

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

1995

Breaking the Probability 1/2 Barrier in FIN-Type Learning.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

Towards Reduction Argumentf for FINite Learning.

[BibT_eX]

[DOI]

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

1994

The power of probabilism in Popperian FINite learning.

[BibT_eX]

[DOI]

Mahe Velauthapillai

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

1993

Capabilities of fallible FINite Learning.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

Capabilities of Probabilistic Learners with Bounded Mind Changes.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

Use of Reduction Arguments in Determining Popperian FIN-Type Learning Capabilities.

[BibT_eX]

[DOI]

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

1992

Probabilistic and Pluralistic Learners with Mind Changes.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Breaking the Probability <i>1/2</i> Barrier in FIN-Type Learning.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

The Power of Probabilism in Popperian FINite Learning (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Analogical and Inductive Inference, 1992

1991

Multi-Agent Learning: Theoretical and Empirical Studies.

[BibT_eX]

[DOI]

Proceedings of the Nonmonotonic and Inductive Logic, 1991

Relations Between Probabilistic and Team One-Shot Learners (Extended Abstract).

[BibT_eX]

[DOI]

Leonard Pitt

Todd Will

Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

1988

Transformation of Probabilistic Learning Strategies into Deterministic Learning Strategies.

[BibT_eX]

[DOI]

Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

1986

On the Complexity of Inductive Inference

[BibT_eX]

[DOI]

Carl H. Smith

Inf. Control., 1986

Towards the Development of an Analysis of Learning Algorithms (Invited Key Note).

[BibT_eX]

[DOI]

Proceedings of the Analogical and Inductive Inference, 1986

Using the Algorithm of Analogy for Generation of Robot Programs.

[BibT_eX]

[DOI]

Proceedings of the Analogical and Inductive Inference, 1986

1985

Inductive inference hierarchies: probabilistic vs pluralistic strategies.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Methods of Specification and Synthesis of Software Systems '85, 1985

1984

On the complextiy of inductive inference.

[BibT_eX]

Carl H. Smith

Bull. EATCS, 1984

On the Complexity of Inductive Inference (Preliminary Report).

[BibT_eX]

[DOI]

Carl H. Smith

Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1983

On the Error Correcting Power of Pluralism in BC-Type Inductive Inference.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1983

1982

Busy Beaver Sets: Characterizations and Applications

[BibT_eX]

[DOI]

Inf. Control., January, 1982

1981

Busy Beaver Sets and the Degrees of Unsolvability.

[BibT_eX]

[DOI]

J. Symb. Log., 1981

Retraceability, Repleteness and Busy Beaver Sets.

[BibT_eX]

[DOI]

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

On the Error Correcting Power of Pluralism in Inductive Inference.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1981

1980

Quantitative and Qualitative Information in Computations

[BibT_eX]

[DOI]

Inf. Control., June, 1980

1979

On the Simplification of Constructions in Degrees of Unsolvability via Computational Complexity.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1978

On the Simplicity of Busy Beaver Sets.

[BibT_eX]

[DOI]

Math. Log. Q., 1978

1977

On the Inference of Optimal Descriptions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1977

1976

Noncomplex Sequences: Characterizations and Examples.

[BibT_eX]

[DOI]

J. Symb. Log., 1976

1975

Minimal-Program Complexity of Pseudo-Recursive and Pseudo-Random Sequences.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1975

1974

The Extent and Density of Sequences within the Minimal-Program Complexity Hierarchies.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1974

Non-Complex Sequences: Characterizations and Examples

[BibT_eX]

[DOI]

Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974

1973

Minimal-Program Complexity of Sequences with Restricted Resources

[BibT_eX]

[DOI]

Inf. Control., November, 1973

An Example of Information and Computation Resource Trade-Off.

[BibT_eX]

[DOI]

J. ACM, 1973

The Process Complexity and the Understanding of Sequences.

[BibT_eX]