Martin Kummer

Available identifiers

Publication	Date of Publication	Type
Effective strategies for enumeration games	2024-06-21	Paper
Measure, category and learning theory	2019-01-10	Paper
Resource-bounded instance complexity	2017-12-04	Paper
On a quantitative notion of uniformity	2010-06-17	Paper
On the structure of degrees of inferability.	2008-12-21	Paper
https://portal.mardi4nfdi.de/entity/Q2757846	2001-12-04	Paper
The complexity of ODD_n^A	2000-06-22	Paper
On the relative sizes of learnable sets	1998-08-13	Paper
https://portal.mardi4nfdi.de/entity/Q4375806	1998-05-10	Paper
Learning recursive functions from approximations	1998-02-02	Paper
On resource-bounded instance complexity	1997-02-27	Paper
Inclusion problems in parallel learning and games	1996-11-26	Paper
https://portal.mardi4nfdi.de/entity/Q4864470	1996-07-07	Paper
Approximable sets	1996-04-16	Paper
Recursion theoretic properties of frequency computation and bounded queries	1995-10-29	Paper
Quantifying the amount of verboseness	1995-05-28	Paper
Effective Search Problems	1995-02-16	Paper
Extremes in the degrees of inferability	1994-05-03	Paper
https://portal.mardi4nfdi.de/entity/Q4282611	1994-03-17	Paper
Weakly semirecursive sets and r.e. orderings	1993-05-16	Paper
Erratum to: On resonant non linearly coupled oscillators with two equal frequencies	1978-01-01	Paper

This page was built for person: Martin Kummer