Your search returned the following 6 documents:

6. Memory-limited non-U-shaped learning with solved open problems
   John Case and Timo Kötzing
   Theoretical Computer Science 473: 100-123, 2013
   
5. Computability-theoretic learning complexity
   John Case and Timo Kötzing
   Philosophical Transaction of the Royal Society A 370 (1971): 3570-3596, 2012
   
4. Learning secrets interactively. Dynamic modeling in inductive inference
   John Case and Timo Kötzing
   Information and Computation 220-221: 60-73, 2012
   
3. Measuring Learning Complexity with Criteria Epitomizers
   John Case and Timo Kötzing
   In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), Dortmund, Germany, 2011, 320-331
   
2. Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
   John Case and Timo Kötzing
   In: Algorithmic Learning Theory : 21st International Conference, ALT 2010, Canberra, Australia, 2010, 285-299
   
1. Strongly Non-U-Shaped Learning Results by General Techniques
   John Case and Timo Kötzing
   In: COLT 2010 : The 23rd Conference on Learning Theory, Haifa, Israel, 2010, 181-193