| Systems that learn: An introduction to learning theory for cognitive and computer scientists. DN Osherson, M Stob, S Weinstein The MIT Press, 1986 | 947 | 1986 |
| Default probability DN Osherson, J Stern, O Wilkie, M Stob, EE Smith Cognitive Science 15 (2), 251-269, 1991 | 178 | 1991 |
| Array nonrecursive sets and multiple permitting arguments R Downey, C Jockusch, M Stob Recursion Theory Week: Proceedings of a Conference held in Oberwolfach, FRG …, 2006 | 119 | 2006 |
| Array nonrecursive degrees and genericity R Downey, C Jockusch, M Stob Computability, enumerability, unsolvability 224, 93-104, 1996 | 105 | 1996 |
| Computable boolean algebras JF Knight, M Stob The Journal of Symbolic Logic 65 (4), 1605-1623, 2000 | 84 | 2000 |
| Learning theory and natural language DN Osherson, M Stob, S Weinstein Cognition 17 (1), 1-28, 1984 | 76 | 1984 |
| Learning strategies DN Osherson, M Stob, S Weinstein Information and Control 53 (1-2), 32, 1982 | 70 | 1982 |
| Splitting theorems in recursion theory R Downey, M Stob Annals of Pure and Applied Logic 65 (1), 1-106, 1993 | 65 | 1993 |
| Wtt-degrees and T-degrees of re sets M Stob The Journal of symbolic logic 48 (4), 921-930, 1983 | 61 | 1983 |
| A universal inductive inference machine DN Osherson, M Stob, S Weinstein The Journal of symbolic logic 56 (2), 661-672, 1991 | 52 | 1991 |
| Aggregating inductive expertise DN Osherson, M Stob, S Weinstein Information and Control 70 (1), 69, 1986 | 46 | 1986 |
| Splitting properties and jump classes W Maass, RA Shore, M Stob Israel Journal of Mathematics 39 (3), 210-224, 1981 | 43 | 1981 |
| Automorphisms of the lattice of recursively enumerable sets: Orbits RG Downey, M Stob Advances in Mathematics 92 (2), 237, 1992 | 39 | 1992 |
| Modular learning DN Osherson Computational neuroscience, 1990 | 38 | 1990 |
| Mechanical learners pay a price for Bayesianism DN Osherson, M Stob, S Weinstein The Journal of symbolic logic 53 (4), 1245-1251, 1988 | 37 | 1988 |
| A supplement to “A mathematician's guide to popular sports” M Stob The American Mathematical Monthly 91 (5), 277-282, 1984 | 33 | 1984 |
| The intervals of the lattice of recursively enumerable sets determined by major subsets W Maass, M Stob Annals of pure and applied Logic 24 (2), 189, 1983 | 33 | 1983 |
| Extrapolating human probability judgment D Osherson, EE Smith, TS Myers, E Shafir, M Stob Theory and Decision 36, 103-129, 1994 | 30 | 1994 |
| Automorphisms of the lattice of recursively enumerable sets: Promptly simple sets P Cholak, R Downey, M Stob Transactions of the American Mathematical Society 332 (2), 555-570, 1992 | 30 | 1992 |
| Synthesizing inductive expertise DN Osherson, M Stob, S Weinstein Information and Computation 77 (2), 138-161, 1988 | 30 | 1988 |
