Ideal Learning Machines. - Daniel N. Osherson; Michael Stob; Scott Weinstein (Cogn. Sci., 1982)

Learning Strategies - Daniel N. Osherson; Michael Stob; Scott Weinstein (Inf. Control., 1982)

Index Sets and Degrees of Unsolvability. - Michael Stob (J. Symb. Log., 1982)

Formal Theories of Language Acquisition: Practical and Theoretical Perspectives. - Daniel N. Osherson; Michael Stob; Scott Weinstein (IJCAI, 1983)

The intervals of the lattice of recursively enumerable sets determined by major subsets. - Wolfgang Maass 001; Michael Stob (Ann. Pure Appl. Log., 1983)

Wtt-Degrees and T-Degrees of R.E. Sets. - Michael Stob (J. Symb. Log., 1983)

Structural interactions of the recursively enumerable T- and W-degrees. - Rodney G. Downey; Michael Stob (Ann. Pure Appl. Log., 1986)

Aggregating Inductive Expertise - Daniel N. Osherson; Michael Stob; Scott Weinstein (Inf. Control., 1986)

Mechanical Learners Pay a Price for Bayesianism. - Daniel N. Osherson; Michael Stob; Scott Weinstein (J. Symb. Log., 1988)

Synthesizing Inductive Expertise - Daniel N. Osherson; Michael Stob; Scott Weinstein (Inf. Comput., 1988)

On Approximate Truth. - Daniel N. Osherson; Michael Stob; Scott Weinstein (COLT, 1989)

A Mechanical Method of Successful Scientific Inquiry. - Daniel N. Osherson; Michael Stob; Scott Weinstein (COLT, 1990)

A Universal Inductive Inference Machine. - Daniel N. Osherson; Michael Stob; Scott Weinstein (J. Symb. Log., 1991)

A Universal Method of Scientific Inquiry. - Daniel N. Osherson; Michael Stob; Scott Weinstein (Mach. Learn., 1992)

Splitting Theorems in Recursion Theory. - Rodney G. Downey; Michael Stob (Ann. Pure Appl. Logic, 1993)

Friedberg Splittings of Recursively Enumerable Sets. - Rodney G. Downey; Michael Stob (Ann. Pure Appl. Log., 1993)

Computable Boolean Algebras. - Julia F. Knight; Michael Stob (J. Symb. Log., 2000)