| 2000 |
|---|
| 14 | | Julia F. Knight,
Michael Stob:
Computable Boolean Algebras.
J. Symb. Log. 65(4): 1605-1623 (2000) |
| 1993 |
|---|
| 13 | | Rodney G. Downey,
Michael Stob:
Friedberg Splittings of Recursively Enumerable Sets.
Ann. Pure Appl. Logic 59(3): 175-199 (1993) |
| 12 | | Rodney G. Downey,
Michael Stob:
Splitting Theorems in Recursion Theory.
Ann. Pure Appl. Logic 65(1): 1-106 (1993) |
| 1992 |
|---|
| 11 | | Daniel N. Osherson,
Michael Stob,
Scott Weinstein:
A Universal Method of Scientific Inquiry.
Machine Learning 9: 261-271 (1992) |
| 1991 |
|---|
| 10 | | Daniel N. Osherson,
Michael Stob,
Scott Weinstein:
A Universal Inductive Inference Machine.
J. Symb. Log. 56(2): 661-672 (1991) |
| 1990 |
|---|
| 9 | EE | Daniel N. Osherson,
Michael Stob,
Scott Weinstein:
A Mechanical Method of Successful Scientific Inquiry.
COLT 1990: 187-201 |
| 1989 |
|---|
| 8 | EE | Daniel N. Osherson,
Michael Stob,
Scott Weinstein:
On Approximate Truth.
COLT 1989: 88-101 |
| 1988 |
|---|
| 7 | | Daniel N. Osherson,
Michael Stob,
Scott Weinstein:
Synthesizing Inductive Expertise
Inf. Comput. 77(2): 138-161 (1988) |
| 6 | | Daniel N. Osherson,
Michael Stob,
Scott Weinstein:
Mechanical Learners Pay a Price for Bayesianism.
J. Symb. Log. 53(4): 1245-1251 (1988) |
| 1986 |
|---|
| 5 | | Daniel N. Osherson,
Michael Stob,
Scott Weinstein:
Aggregating Inductive Expertise
Information and Control 70(1): 69-95 (1986) |
| 1983 |
|---|
| 4 | | Daniel N. Osherson,
Michael Stob,
Scott Weinstein:
Formal Theories of Language Acquisition: Practical and Theoretical Perspectives.
IJCAI 1983: 566-572 |
| 3 | | Michael Stob:
Wtt-Degrees and T-Degrees of R.E. Sets.
J. Symb. Log. 48(4): 921-930 (1983) |
| 1982 |
|---|
| 2 | | Daniel N. Osherson,
Michael Stob,
Scott Weinstein:
Learning Strategies
Information and Control 53(1/2): 32-51 (1982) |
| 1 | | Michael Stob:
Index Sets and Degrees of Unsolvability.
J. Symb. Log. 47(2): 241-248 (1982) |
