The following pages link to Frank Stephan (Q324251):
Displaying 50 items.
- (Q198234) (redirect page) (← links)
- Finite state incompressible infinite sequences (Q259039) (← links)
- On the role of update constraints and text-types in iterative learning (Q259061) (← links)
- Tree-automatic scattered linear orders (Q264574) (← links)
- Inductive inference and reverse mathematics (Q324252) (← links)
- Enlarging learnable classes (Q342717) (← links)
- Automatic models of first order theories (Q387121) (← links)
- Learning and classifying (Q390916) (← links)
- Learning with ordinal-bounded memory from positive data (Q440010) (← links)
- Confident and consistent partial learning of recursive functions (Q465247) (← links)
- Covering the recursive sets (Q508828) (← links)
- Selective versions of chain condition-type properties (Q519994) (← links)
- Universal recursively enumerable sets of strings (Q533863) (← links)
- Van Lambalgen's theorem and high degrees (Q540405) (← links)
- Classes with easily learnable subclasses (Q598186) (← links)
- On the classification of recursive languages (Q598240) (← links)
- \((\delta, \delta ')\)-continuity on generalized topological spaces (Q626043) (← links)
- Higher Kurtz randomness (Q636362) (← links)
- Automatic learning of subclasses of pattern languages (Q690501) (← links)
- How powerful are integer-valued martingales? (Q693070) (← links)
- Index sets and universal numberings (Q716308) (← links)
- Representation of left-computable \(\varepsilon \)-random reals (Q716316) (← links)
- Constructive dimension and Turing degrees (Q733739) (← links)
- Input-dependence in function-learning (Q733744) (← links)
- Ordered semiautomatic rings with applications to geometry (Q782566) (← links)
- Unifying logic, topology and learning in parametric logic (Q817837) (← links)
- On the learnability of vector spaces (Q859986) (← links)
- On ordinal VC-dimension and some notions of complexity (Q860824) (← links)
- Learning a subclass of regular patterns in polynomial time (Q860829) (← links)
- Randomness and universal machines (Q864423) (← links)
- On the complexity of \(p\)-adic basic semi-algebraic sets (Q883331) (← links)
- Reducibilities among equivalence relations induced by recursively enumerable structures (Q896924) (← links)
- On block pumpable languages (Q897892) (← links)
- Absolute versus probabilistic classification in a logical setting (Q924172) (← links)
- When unlearning helps (Q924730) (← links)
- Non-U-shaped vacillatory and team learning (Q927864) (← links)
- Immunity and hyperimmunity for sets of minimal indices (Q929628) (← links)
- Learning in Friedberg numberings (Q939445) (← links)
- \(\Pi_1^0 \) classes, LR degrees and Turing degrees (Q958483) (← links)
- Computable categoricity and the Ershov hierarchy (Q958489) (← links)
- On the structure of degrees of inferability. (Q960466) (← links)
- Numberings optimal for learning (Q972383) (← links)
- Topological aspects of poset spaces (Q977107) (← links)
- Iterative learning of simple external contextual languages (Q982646) (← links)
- Prescribed learning of r.e. classes (Q1017658) (← links)
- Weakly semirecursive sets and r.e. orderings (Q1210140) (← links)
- Classification using information (Q1273758) (← links)
- Learning via queries and oracles (Q1295409) (← links)
- Extremes in the degrees of inferability (Q1319507) (← links)
- Noisy inference and oracles (Q1390946) (← links)
