Michael Stob

J. Symb. Log., 2000

1993

Friedberg Splittings of Recursively Enumerable Sets.

[BibT_eX]

[DOI]

Rodney G. Downey

Ann. Pure Appl. Log., 1993

Splitting Theorems in Recursion Theory.

[BibT_eX]

[DOI]

Rodney G. Downey

Ann. Pure Appl. Logic, 1993

1992

A Universal Method of Scientific Inquiry.

[BibT_eX]

[DOI]

Mach. Learn., 1992

1991

A Universal Inductive Inference Machine.

[BibT_eX]

[DOI]

J. Symb. Log., 1991

1990

A Mechanical Method of Successful Scientific Inquiry.

[BibT_eX]

[DOI]

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

1989

On Approximate Truth.

[BibT_eX]

[DOI]

Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989

1988

Synthesizing Inductive Expertise

[BibT_eX]

[DOI]

Inf. Comput., May, 1988

Mechanical Learners Pay a Price for Bayesianism.

[BibT_eX]

[DOI]

J. Symb. Log., 1988

1986

Aggregating Inductive Expertise

[BibT_eX]

[DOI]

Inf. Control., July, 1986

Structural interactions of the recursively enumerable T- and W-degrees.

[BibT_eX]

[DOI]

Rodney G. Downey

Ann. Pure Appl. Log., 1986

1983

Wtt-Degrees and T-Degrees of R.E. Sets.

[BibT_eX]

[DOI]

J. Symb. Log., 1983

The intervals of the lattice of recursively enumerable sets determined by major subsets.

[BibT_eX]

[DOI]

Wolfgang Maass

Ann. Pure Appl. Log., 1983

Formal Theories of Language Acquisition: Practical and Theoretical Perspectives.

[BibT_eX]

[DOI]

Proceedings of the 8th International Joint Conference on Artificial Intelligence. Karlsruhe, 1983

1982

Index Sets and Degrees of Unsolvability.

[BibT_eX]

[DOI]

J. Symb. Log., 1982

Learning Strategies

[BibT_eX]

[DOI]

Inf. Control., 1982

Ideal Learning Machines.

[BibT_eX]

[DOI]