The following pages link to Thomas Zeugmann (Q440005):
Displaying 50 items.
- (Q198423) (redirect page) (← links)
- Testable and untestable classes of first-order formulae (Q440006) (← links)
- Teaching randomized learners with feedback (Q553294) (← links)
- Monotonic and dual monotonic language learning (Q672148) (← links)
- One-sided error probabilistic inductive inference and reliable frequency identification (Q803119) (← links)
- From learning in the limit to stochastic finite learning (Q860825) (← links)
- Learning a subclass of regular patterns in polynomial time (Q860829) (← links)
- Learning recursive functions: A survey (Q924164) (← links)
- Learning indexed families of recursive languages from positive data: A survey (Q924177) (← links)
- Consistent and coherent learning with \(\delta \)-delay (Q958312) (← links)
- On the power of recursive optimizers (Q1114401) (← links)
- Highly parallel computations modulo a number having only small prime factors (Q1184734) (← links)
- Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time (Q1273756) (← links)
- An average-case optimal one-variable pattern language learner (Q1567401) (← links)
- Learning languages and functions by erasing (Q1575464) (← links)
- Incremental learning from positive data (Q1816744) (← links)
- Learning classes of approximations to non-recursive functions. (Q1853518) (← links)
- Incremental concept learning for bounded data mining. (Q1854293) (← links)
- On learning of functions refutably. (Q1874231) (← links)
- Characterizations of monotonic and dual monotonic language learning (Q1898458) (← links)
- On the amount of nonconstructivity in learning formal languages from text (Q2051759) (← links)
- On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings (Q2106597) (← links)
- Inductive inference of approximations for recursive concepts (Q2581360) (← links)
- Mathematical Analysis and the Mathematics of Computation (Q2831919) (← links)
- On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data (Q2898054) (← links)
- Active Learning of Recursive Functions by Ultrametric Algorithms (Q2938104) (← links)
- Untestable Properties in the Kahr-Moore-Wang Class (Q3003359) (← links)
- On the Amount of Nonconstructivity in Learning Recursive Functions (Q3010414) (← links)
- (Q3326838) (← links)
- (Q3329450) (← links)
- (Q3334984) (← links)
- ON THE NONBOUNDABILITY OF TOTAL EFFECTIVE OPERATORS (Q3340849) (← links)
- On the Influence of Technology on Learning Processes (Q3458194) (← links)
- Indistinguishability and First-Order Logic (Q3502636) (← links)
- Teaching Memoryless Randomized Learners Without Feedback (Q3522979) (← links)
- Learning by erasing (Q3556996) (← links)
- Clustering the Normalized Compression Distance for Influenza Virus Data (Q3558264) (← links)
- Untestable Properties Expressible with Four First-Order Quantifiers (Q3564875) (← links)
- A Note on the Testability of Ramsey’s Class (Q3569084) (← links)
- Recent Developments in Algorithmic Teaching (Q3618563) (← links)
- Relational Properties Expressible with One Universal Quantifier Are Testable (Q3646124) (← links)
- (Q3679162) (← links)
- (Q3722485) (← links)
- (Q3730002) (← links)
- (Q3790671) (← links)
- (Q3974869) (← links)
- (Q3976052) (← links)
- (Q4202923) (← links)
- (Q4207582) (← links)
- (Q4281570) (← links)
