The following pages link to Martin Kummer (Q960465):
Displaying 22 items.
- (Q685477) (redirect page) (← links)
- On the non-existence of maximal inference degrees for language identification (Q685478) (← links)
- A note on enumerative counting (Q809598) (← links)
- An easy priority-free proof of a theorem of Friedberg (Q913786) (← links)
- On the structure of degrees of inferability. (Q960466) (← links)
- The Gaussian curvature of associated manifold of dynamical systems (Q1062331) (← links)
- Canonical transformations, umbral calculus and orthogonal theory (Q1082100) (← links)
- On the relative sizes of learnable sets (Q1128667) (← links)
- The complexity types of computable sets (Q1190982) (← links)
- On polynomial time one-truth-table reducibility to a sparse set (Q1191028) (← links)
- Weakly semirecursive sets and r.e. orderings (Q1210140) (← links)
- (Q1246773) (redirect page) (← links)
- Erratum to: On resonant non linearly coupled oscillators with two equal frequencies (Q1246774) (← links)
- Hard promise problems and nonuniform complexity (Q1261468) (← links)
- Extremes in the degrees of inferability (Q1319507) (← links)
- On resource-bounded instance complexity (Q1351945) (← links)
- Learning recursive functions from approximations (Q1370868) (← links)
- Quantifying the amount of verboseness (Q1891135) (← links)
- Approximable sets (Q1898468) (← links)
- Recursion theoretic properties of frequency computation and bounded queries (Q1898479) (← links)
- Inclusion problems in parallel learning and games (Q1924379) (← links)
- (Q2757846) (← links)
