John Case

From MaRDI portal
Person:235644

Available identifiers

zbMath Open case.johnMaRDI QIDQ235644

List of research outcomes





PublicationDate of PublicationType
Machine induction without revolutionary paradigm shifts2023-12-08Paper
On the classification of computable languages2022-11-09Paper
Learnability: Admissible, co-finite, and hypersimple languages2019-03-29Paper
Effectivity questions for Kleene's recursion theorem2018-06-05Paper
A Non-Uniformly C-Productive Sequence & Non-Constructive Disjunctions2017-06-09Paper
Gold-Style Learning Theory2017-02-15Paper
Strongly non-U-shaped language learning results by general techniques2016-11-18Paper
Program Size Complexity of Correction Grammars in the Ershov Hierarchy2016-08-17Paper
Non-obfuscated unprovable programs \& many resultant subtleties2016-04-28Paper
Topological separations in inductive inference2016-02-26Paper
Effectivity Questions for Kleene’s Recursion Theorem2015-12-11Paper
Lattice computers for approximating Euclidean space2015-09-20Paper
Computability-theoretic learning complexity2015-08-21Paper
Automatic learners with feedback queries2014-02-13Paper
Topological Separations in Inductive Inference2013-11-06Paper
Automatic functions, linear time and learning2013-09-26Paper
Beyond Rogers’ Non-constructively Computable Function2013-08-05Paper
Memory-limited non-U-shaped learning with solved open problems2013-03-04Paper
Learning secrets interactively. Dynamic modeling in inductive inference2013-01-17Paper
Program self-reference in constructive Scott subdomains2012-12-07Paper
Automatic learning of subclasses of pattern languages2012-11-27Paper
Automatic Functions, Linear Time and Learning2012-08-14Paper
https://portal.mardi4nfdi.de/entity/Q32257022012-03-22Paper
https://portal.mardi4nfdi.de/entity/Q31136962012-01-23Paper
Rice and Rice-Shapiro Theorems for transfinite correction grammars2011-11-07Paper
Optimal language learning from positive data2011-10-27Paper
Automatic Learners with Feedback Queries2011-09-09Paper
Automatic Learning of Subclasses of Pattern Languages2011-06-03Paper
Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations2010-10-01Paper
Program Self-reference in Constructive Scott Subdomains2010-07-28Paper
Iterative learning of simple external contextual languages2010-07-07Paper
Vacillatory and BC learning on noisy data2010-04-27Paper
Learning Theory and Kernel Machines2010-03-23Paper
Learning Theory and Kernel Machines2010-03-23Paper
Algorithmic Learning Theory2010-02-23Paper
Difficulties in Forcing Fairness of Polynomial Time Inductive Inference2009-12-01Paper
Independence Results for n-Ary Recursion Theorems2009-10-20Paper
Characterizing programming systems allowing program self-reference2009-10-19Paper
Resource restricted computability theoretic learning: Illustrative topics and problems2009-10-19Paper
Learning correction grammars2009-06-04Paper
Parallelism increases iterative learning power2009-05-12Paper
U-shaped, iterative, and iterative-with-counter learning2009-03-31Paper
Optimal Language Learning2008-10-14Paper
Dynamically Delayed Postdictive Completeness and Consistency in Learning2008-10-14Paper
Dynamic Modeling in Inductive Inference2008-10-14Paper
Iterative Learning of Simple External Contextual Languages2008-10-14Paper
Properties Complementary to Program Self-reference2008-09-17Paper
Feasible Iteration of Feasible Learning Functionals2008-08-19Paper
Parallelism Increases Iterative Learning Power2008-08-19Paper
Non-U-shaped vacillatory and team learning2008-06-10Paper
When unlearning helps2008-05-19Paper
Learning Correction Grammars2008-01-03Paper
U-Shaped, Iterative, and Iterative-with-Counter Learning2008-01-03Paper
Characterizing Programming Systems Allowing Program Self-reference2007-11-13Paper
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems2007-11-13Paper
Results on memory-limited U-shaped learning2007-10-10Paper
Memory-Limited U-Shaped Learning2007-09-14Paper
https://portal.mardi4nfdi.de/entity/Q34471982007-06-28Paper
Learning a subclass of regular patterns in polynomial time2007-01-09Paper
Algorithmic Learning Theory2006-11-01Paper
Grammatical Inference: Algorithms and Applications2006-10-20Paper
Identifying Clusters from Positive Data2006-06-01Paper
Generality's price: Inescapable deficiencies in machine-learned programs2006-04-28Paper
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms2005-10-10Paper
Parsimony hierarchies for inductive inference2005-08-29Paper
Robust learning -- rich and poor2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q47360502004-08-09Paper
On the classification of recursive languages2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44705352004-07-01Paper
Incremental concept learning for bounded data mining.2003-01-14Paper
The synthesis of language learners.2003-01-14Paper
Learning to win process-control games watching game-masters2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q31488032002-09-22Paper
Predictive learning models for concept drift2002-03-03Paper
Control structures in hypothesis spaces: The influence on learning2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q27578482001-12-04Paper
https://portal.mardi4nfdi.de/entity/Q27542012001-11-11Paper
Synthesizing learners tolerating computable noisy data2001-09-09Paper
Synthesizing noise-tolerant language learners2001-08-20Paper
Costs of general purpose learning2001-08-20Paper
Vacillatory and BC learning on noisy data2000-08-21Paper
Robust learning aided by context2000-07-24Paper
https://portal.mardi4nfdi.de/entity/Q42470002000-03-13Paper
https://portal.mardi4nfdi.de/entity/Q42470122000-03-13Paper
https://portal.mardi4nfdi.de/entity/Q42470082000-01-12Paper
The Power of Vacillation in Language Learning1999-10-28Paper
Maximal machine learnable classes1999-09-22Paper
Learning recursive functions from approximations1998-02-02Paper
Learnability: Admissible, co-finite, and hypersimple languages1997-03-13Paper
Anomalous learning helps succinctness1997-02-27Paper
Machine induction without revolutionary changes in hypothesis size1997-02-03Paper
Language learning with some negative information1995-10-25Paper
Complexity issues for vacillatory function identification1995-05-28Paper
Spatial/kinematic domain and lattice computers1995-01-02Paper
Infinitary self-reference in learning theory1995-01-02Paper
https://portal.mardi4nfdi.de/entity/Q43107021994-11-01Paper
https://portal.mardi4nfdi.de/entity/Q43000601994-09-08Paper
Machine learning of higher-order programs1994-08-15Paper
https://portal.mardi4nfdi.de/entity/Q42815691994-03-10Paper
ON LEARNING LIMITING PROGRAMS1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40135371992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39760581992-06-26Paper
Effectivizing Inseparability1992-06-26Paper
Pseudo-extensions of computable functions1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37049101982-01-01Paper
On the Relative Merits of the English and American Rules for Allocating Court Costs1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38519621979-01-01Paper
The complexity of total order structures1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41611261977-01-01Paper
Sortability and Extensibility of the Graphs of Recursively Enumerable Partial and Total Orders1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40629831975-01-01Paper
On the Form of Market Demand Functions1974-01-01Paper
Periodicity in generations of automata1974-01-01Paper
Maximal Arithmetical Reducibilities1974-01-01Paper
A class of games having Pareto optimal Nash equilibria1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40822981974-01-01Paper
Enumeration reducibility and partial degrees1971-01-01Paper
A Note on Degrees of Self-Describing Turing Machines1971-01-01Paper
A Differential Game in Economics1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56452411971-01-01Paper
A Note on the Stability of Predictor-Corrector Techniques1969-01-01Paper

Research outcomes over time

This page was built for person: John Case