Publication | Date of Publication | Type |
---|
Machine induction without revolutionary paradigm shifts | 2023-12-08 | Paper |
On the classification of computable languages | 2022-11-09 | Paper |
Learnability: Admissible, co-finite, and hypersimple languages | 2019-03-29 | Paper |
Effectivity questions for Kleene's recursion theorem | 2018-06-05 | Paper |
A Non-Uniformly C-Productive Sequence & Non-Constructive Disjunctions | 2017-06-09 | Paper |
Gold-Style Learning Theory | 2017-02-15 | Paper |
Strongly non-U-shaped language learning results by general techniques | 2016-11-18 | Paper |
Program Size Complexity of Correction Grammars in the Ershov Hierarchy | 2016-08-17 | Paper |
Non-Obfuscated Unprovable Programs & Many Resultant Subtleties | 2016-04-28 | Paper |
Topological separations in inductive inference | 2016-02-26 | Paper |
Effectivity Questions for Kleene’s Recursion Theorem | 2015-12-11 | Paper |
Lattice computers for approximating Euclidean space | 2015-09-20 | Paper |
Computability-theoretic learning complexity | 2015-08-21 | Paper |
Automatic learners with feedback queries | 2014-02-13 | Paper |
Topological Separations in Inductive Inference | 2013-11-06 | Paper |
Automatic functions, linear time and learning | 2013-09-26 | Paper |
Beyond Rogers’ Non-constructively Computable Function | 2013-08-05 | Paper |
Memory-limited non-U-shaped learning with solved open problems | 2013-03-04 | Paper |
Learning secrets interactively. Dynamic modeling in inductive inference | 2013-01-17 | Paper |
Program self-reference in constructive Scott subdomains | 2012-12-07 | Paper |
Automatic learning of subclasses of pattern languages | 2012-11-27 | Paper |
Automatic Functions, Linear Time and Learning | 2012-08-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q3225702 | 2012-03-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q3113696 | 2012-01-23 | Paper |
Rice and Rice-Shapiro Theorems for transfinite correction grammars | 2011-11-07 | Paper |
Optimal language learning from positive data | 2011-10-27 | Paper |
Automatic Learners with Feedback Queries | 2011-09-09 | Paper |
Automatic Learning of Subclasses of Pattern Languages | 2011-06-03 | Paper |
Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations | 2010-10-01 | Paper |
Program Self-reference in Constructive Scott Subdomains | 2010-07-28 | Paper |
Iterative learning of simple external contextual languages | 2010-07-07 | Paper |
Vacillatory and BC learning on noisy data | 2010-04-27 | Paper |
Learning Theory and Kernel Machines | 2010-03-23 | Paper |
Learning Theory and Kernel Machines | 2010-03-23 | Paper |
Algorithmic Learning Theory | 2010-02-23 | Paper |
Difficulties in Forcing Fairness of Polynomial Time Inductive Inference | 2009-12-01 | Paper |
Independence Results for n-Ary Recursion Theorems | 2009-10-20 | Paper |
Characterizing programming systems allowing program self-reference | 2009-10-19 | Paper |
Resource restricted computability theoretic learning: Illustrative topics and problems | 2009-10-19 | Paper |
Learning correction grammars | 2009-06-04 | Paper |
Parallelism increases iterative learning power | 2009-05-12 | Paper |
U-shaped, iterative, and iterative-with-counter learning | 2009-03-31 | Paper |
Iterative Learning of Simple External Contextual Languages | 2008-10-14 | Paper |
Dynamically Delayed Postdictive Completeness and Consistency in Learning | 2008-10-14 | Paper |
Dynamic Modeling in Inductive Inference | 2008-10-14 | Paper |
Optimal Language Learning | 2008-10-14 | Paper |
Properties Complementary to Program Self-reference | 2008-09-17 | Paper |
Feasible Iteration of Feasible Learning Functionals | 2008-08-19 | Paper |
Parallelism Increases Iterative Learning Power | 2008-08-19 | Paper |
Non-U-shaped vacillatory and team learning | 2008-06-10 | Paper |
When unlearning helps | 2008-05-19 | Paper |
U-Shaped, Iterative, and Iterative-with-Counter Learning | 2008-01-03 | Paper |
Learning Correction Grammars | 2008-01-03 | Paper |
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems | 2007-11-13 | Paper |
Characterizing Programming Systems Allowing Program Self-reference | 2007-11-13 | Paper |
Results on memory-limited U-shaped learning | 2007-10-10 | Paper |
Memory-Limited U-Shaped Learning | 2007-09-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q3447198 | 2007-06-28 | Paper |
Learning a subclass of regular patterns in polynomial time | 2007-01-09 | Paper |
Algorithmic Learning Theory | 2006-11-01 | Paper |
Grammatical Inference: Algorithms and Applications | 2006-10-20 | Paper |
Identifying Clusters from Positive Data | 2006-06-01 | Paper |
Generality's price: Inescapable deficiencies in machine-learned programs | 2006-04-28 | Paper |
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms | 2005-10-10 | Paper |
Parsimony hierarchies for inductive inference | 2005-08-29 | Paper |
Robust learning -- rich and poor | 2004-10-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4736050 | 2004-08-09 | Paper |
On the classification of recursive languages | 2004-08-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q4470535 | 2004-07-01 | Paper |
The synthesis of language learners. | 2003-01-14 | Paper |
Incremental concept learning for bounded data mining. | 2003-01-14 | Paper |
Learning to win process-control games watching game-masters | 2003-01-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q3148803 | 2002-09-22 | Paper |
Control structures in hypothesis spaces: The influence on learning | 2002-03-03 | Paper |
Predictive learning models for concept drift | 2002-03-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q2757848 | 2001-12-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q2754201 | 2001-11-11 | Paper |
Synthesizing learners tolerating computable noisy data | 2001-09-09 | Paper |
Costs of general purpose learning | 2001-08-20 | Paper |
Synthesizing noise-tolerant language learners | 2001-08-20 | Paper |
Vacillatory and BC learning on noisy data | 2000-08-21 | Paper |
Robust learning aided by context | 2000-07-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q4247000 | 2000-03-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q4247012 | 2000-03-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q4247008 | 2000-01-12 | Paper |
The Power of Vacillation in Language Learning | 1999-10-28 | Paper |
Maximal machine learnable classes | 1999-09-22 | Paper |
Learning recursive functions from approximations | 1998-02-02 | Paper |
Learnability: Admissible, co-finite, and hypersimple languages | 1997-03-13 | Paper |
Anomalous learning helps succinctness | 1997-02-27 | Paper |
Machine induction without revolutionary changes in hypothesis size | 1997-02-03 | Paper |
Language learning with some negative information | 1995-10-25 | Paper |
Complexity issues for vacillatory function identification | 1995-05-28 | Paper |
Infinitary self-reference in learning theory | 1995-01-02 | Paper |
Spatial/kinematic domain and lattice computers | 1995-01-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4310702 | 1994-11-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4300060 | 1994-09-08 | Paper |
Machine learning of higher-order programs | 1994-08-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q4281569 | 1994-03-10 | Paper |
ON LEARNING LIMITING PROGRAMS | 1993-01-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4013537 | 1992-09-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q3976058 | 1992-06-26 | Paper |
Effectivizing Inseparability | 1992-06-26 | Paper |
Pseudo-extensions of computable functions | 1983-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3704910 | 1982-01-01 | Paper |
On the Relative Merits of the English and American Rules for Allocating Court Costs | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3851962 | 1979-01-01 | Paper |
The complexity of total order structures | 1978-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4161126 | 1977-01-01 | Paper |
Sortability and Extensibility of the Graphs of Recursively Enumerable Partial and Total Orders | 1976-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4062983 | 1975-01-01 | Paper |
A class of games having Pareto optimal Nash equilibria | 1974-01-01 | Paper |
Periodicity in generations of automata | 1974-01-01 | Paper |
Maximal Arithmetical Reducibilities | 1974-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4082298 | 1974-01-01 | Paper |
On the Form of Market Demand Functions | 1974-01-01 | Paper |
A Differential Game in Economics | 1971-01-01 | Paper |
Enumeration reducibility and partial degrees | 1971-01-01 | Paper |
A Note on Degrees of Self-Describing Turing Machines | 1971-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5645241 | 1971-01-01 | Paper |
A Note on the Stability of Predictor-Corrector Techniques | 1969-01-01 | Paper |