Thomas Zeugmann

From MaRDI portal
Revision as of 21:21, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:440005

Available identifiers

zbMath Open zeugmann.thomasMaRDI QIDQ440005

List of research outcomes





PublicationDate of PublicationType
Co-learning of recursive languages from positive data2024-07-11Paper
On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings2022-12-16Paper
On the amount of nonconstructivity in learning formal languages from text2021-11-25Paper
https://portal.mardi4nfdi.de/entity/Q49672012019-07-03Paper
https://portal.mardi4nfdi.de/entity/Q46176152019-02-06Paper
Mathematical Analysis and the Mathematics of Computation2016-11-03Paper
On the Influence of Technology on Learning Processes2015-12-18Paper
Active Learning of Recursive Functions by Ultrametric Algorithms2015-01-13Paper
Editors’ Introduction2013-11-06Paper
On the Size Complexity of Deterministic Frequency Automata2013-03-18Paper
Testable and untestable classes of first-order formulae2012-08-17Paper
On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data2012-07-16Paper
Teaching randomized learners with feedback2011-07-27Paper
On the Amount of Nonconstructivity in Learning Recursive Functions2011-07-01Paper
Untestable Properties in the Kahr-Moore-Wang Class2011-05-27Paper
Recent Experiences in Parameter-Free Data Mining2010-10-06Paper
A Note on the Testability of Ramsey’s Class2010-06-17Paper
Untestable Properties Expressible with Four First-Order Quantifiers2010-05-26Paper
Clustering the Normalized Compression Distance for Influenza Virus Data2010-05-04Paper
Learning by erasing2010-04-27Paper
Algorithmic Learning Theory2010-02-23Paper
Algorithmic Learning Theory2010-02-23Paper
Relational Properties Expressible with One Universal Quantifier Are Testable2009-11-19Paper
Recent Developments in Algorithmic Teaching2009-04-02Paper
Consistent and coherent learning with \(\delta \)-delay2008-12-03Paper
Teaching Memoryless Randomized Learners Without Feedback2008-09-04Paper
Learning recursive functions: A survey2008-05-28Paper
Learning indexed families of recursive languages from positive data: A survey2008-05-28Paper
Indistinguishability and First-Order Logic2008-05-27Paper
Teaching Randomized Learners2007-09-14Paper
Theory and Applications of Models of Computation2007-04-30Paper
From learning in the limit to stochastic finite learning2007-01-09Paper
Learning a subclass of regular patterns in polynomial time2007-01-09Paper
Algorithmic Learning Theory2006-11-01Paper
Inductive inference of approximations for recursive concepts2006-01-10Paper
https://portal.mardi4nfdi.de/entity/Q47396092004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44732342004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44735352004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44735602004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44705292004-07-01Paper
https://portal.mardi4nfdi.de/entity/Q44705712004-07-01Paper
On learning of functions refutably.2003-05-22Paper
Learning classes of approximations to non-recursive functions.2003-01-21Paper
Incremental concept learning for bounded data mining.2003-01-14Paper
Stochastic finite learning of the pattern languages2001-10-14Paper
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q49553182000-11-07Paper
https://portal.mardi4nfdi.de/entity/Q45053832000-09-27Paper
Learning languages and functions by erasing2000-08-21Paper
An average-case optimal one-variable pattern language learner2000-06-05Paper
https://portal.mardi4nfdi.de/entity/Q49378492000-02-20Paper
https://portal.mardi4nfdi.de/entity/Q47034411999-12-15Paper
https://portal.mardi4nfdi.de/entity/Q47038511999-12-01Paper
https://portal.mardi4nfdi.de/entity/Q47038751999-12-01Paper
Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time1999-03-23Paper
Classifying Predicates and Languages1997-06-16Paper
Monotonic and dual monotonic language learning1997-02-27Paper
Set-driven and rearrangement-independent learning of recursive languages1996-12-01Paper
Incremental learning from positive data1996-11-27Paper
Characterizations of monotonic and dual monotonic language learning1996-04-16Paper
https://portal.mardi4nfdi.de/entity/Q48447491995-08-27Paper
https://portal.mardi4nfdi.de/entity/Q48359031995-07-05Paper
LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES1994-12-18Paper
https://portal.mardi4nfdi.de/entity/Q42815701994-10-19Paper
Characterization of language learning front informant under various monotonicity constraints1994-05-03Paper
Ignoring data may be the only way to learn efficiently1994-05-03Paper
https://portal.mardi4nfdi.de/entity/Q42825611994-04-17Paper
https://portal.mardi4nfdi.de/entity/Q42029231993-09-06Paper
Highly parallel computations modulo a number having only small prime factors1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39748691992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39760521992-06-26Paper
One-sided error probabilistic inductive inference and reliable frequency identification1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42075821989-01-01Paper
On the power of recursive optimizers1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37906711987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37300021986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37224851985-01-01Paper
ON THE NONBOUNDABILITY OF TOTAL EFFECTIVE OPERATORS1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36791621984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33268381983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33294501983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33349841983-01-01Paper

Research outcomes over time

This page was built for person: Thomas Zeugmann