A Note on Degrees of Self-Describing Turing Machines. - John Case (J. ACM, 1971)

Periodicity in Generations of Automata. - John Case (Math. Syst. Theory, 1974)

Sortability and Extensibility of the Graphs of Recursively Enumerable Partial and Total Orders. - John Case (Math. Log. Q., 1976)

Anomaly Hierarchies of Mechanized Inductive Inference - John Case; Carl Smith (STOC, 1978)

The Complexity of Total Order Structures. - Dan Moore; John Case (J. Comput. Syst. Sci., 1978)

Machine Inductive Inference and Language Identification. - John Case; Christopher Lynes (ICALP, 1982)

Pseudo-Extending Computable Functions - John Case (Inf. Control., 1983)

Comparison of Identification Criteria for Machine Inductive Inference. - John Case; Carl Smith (Theor. Comput. Sci., 1983)

The Power of Vacillation. - John Case (COLT, 1988)

Convergence to Nearly Minimal Size Grammars by Vacillating Learning Machines. - Sanjay Jain 001; Arun Sharma 001; John Case (COLT, 1989)

Anomalous Learning Helps Succinctness (Extended Abstract). - John Case; Sanjay Jain 001; Arun Sharma 001 (ALT, 1990)

Optimally Representing Euclidean Space Discretely for Analogically Simulating Physical Phenomena. - John Case; Dayanand S. Rajan; Anil M. Shende (FSTTCS, 1990)

Effectivizing Inseparability. - John Case (Math. Log. Q., 1991)

Representing the Spatial/Kinematic Domain and Lattice Computers. - John Case; Dayanand S. Rajan; Anil M. Shende (AII, 1992)

On Learning Limiting Programs. - John Case; Sanjay Jain 001; Arun Sharma 001 (Int. J. Found. Comput. Sci., 1992)

Strong separation of learning classes. - John Case; Keh-Jiann Chen; Sanjay Jain 001 (J. Exp. Theor. Artif. Intell., 1992)

Subrecursive programming systems - complexity and succinctness. - James S. Royer; John Case (Birkhäuser, 1994)

Learning with Higher Order Additional Information. - Ganesh R. Baliga; John Case (AII/ALT, 1994)

Vacillatory Learning of Nearly Minimal Size Grammars. - John Case; Sanjay Jain 001; Arun Sharma 001 (J. Comput. Syst. Sci., 1994)

Infinitary self-reference in learning theory. - John Case (J. Exp. Theor. Artif. Intell., 1994)

Spatial/kinematic domain and lattice computers. - John Case; Dayanand S. Rajan; Anil M. Shende (J. Exp. Theor. Artif. Intell., 1994)

Machine Learning of Higher-Order Programs. - Ganesh R. Baliga; John Case; Sanjay Jain 001; Mandayam Suraj (J. Symb. Log., 1994)

Refinements of inductive inference by Popperian and reliable machines. - John Case; Sanjay Jain 001; Suzanne Ngo Manguelle (Kybernetika, 1994)

Machine Induction Without Revolutionary Paradigm Shifts. - John Case; Sanjay Jain 001; Arun Sharma 001 (ALT, 1995)

Not-So-Nearly-Minimal-Size Program Inference. - John Case; Mandayam Suraj; Sanjay Jain 001 (GOSLER Final Report, 1995)

Language Learning with Some Negative Information. - Ganesh R. Baliga; John Case; Sanjay Jain 001 (J. Comput. Syst. Sci., 1995)

Complexity Issues for Vacillatory Function Identification - John Case; Sanjay Jain 001; Arun Sharma 001 (Inf. Comput., 1995)

Synthesizing Enumeration Techniques for Language Learning. - Ganesh R. Baliga; John Case; Sanjay Jain 001 (COLT, 1996)

Machine Induction Without Revolutionary Changes in Hypothesis Size. - John Case; Sanjay Jain 001; Arun Sharma 001 (Inf. Comput., 1996)

Learnability: Admissible, Co-Finite, and Hypersimple Languages. - Ganesh R. Baliga; John Case (J. Comput. Syst. Sci., 1996)

Anomalous Learning Helps Succinctness. - John Case; Sanjay Jain 001; Arun Sharma 001 (Theor. Comput. Sci., 1996)

On the Classification of Computable Languages. - John Case; Efim B. Kinber; Arun Sharma 001; Frank Stephan 001 (STACS, 1997)

Learning Recursive Functions from Approximations. - John Case; Susanne Kaufmann; Efim B. Kinber; Martin Kummer (J. Comput. Syst. Sci., 1997)

The Synthesis of Language Learners. - Ganesh R. Baliga; John Case; Sanjay Jain 001 (Inf. Comput., 1999)

Incremental Concept Learning for Bounded Data Mining. - John Case; Sanjay Jain 001; Steffen Lange; Thomas Zeugmann (Inf. Comput., 1999)

Maximal Machine Learnable Classes. - John Case; Mark A. Fulk (J. Comput. Syst. Sci., 1999)

The Power of Vacillation in Language Learning. - John Case (SIAM J. Comput., 1999)

Unlearning Helps. - Ganesh R. Baliga; John Case; Wolfgang Merkle; Frank Stephan 001 (ICALP, 2000)

Robust Learning Aided by Context. - John Case; Sanjay Jain 001; Matthias Ott; Arun Sharma 001; Frank Stephan 001 (J. Comput. Syst. Sci., 2000)

Vacillatory and BC learning on noisy data. - John Case; Sanjay Jain 001; Frank Stephan 001 (Theor. Comput. Sci., 2000)

Divide and Conquer Machine Learning for a Genomics Analogy Problem (Progress Report). - Ming Ouyang; John Case; Joan Burnside (Discovery Science, 2001)

Lattice computers for approximating Euclidean space. - John Case; Dayanand S. Rajan; Anil M. Shende (J. ACM, 2001)

Synthesizing Learners Tolerating Computable Noisy Data. - John Case; Sanjay Jain 001 (J. Comput. Syst. Sci., 2001)

Costs of general purpose learning. - John Case; Keh-Jiann Chen; Sanjay Jain 001 (Theor. Comput. Sci., 2001)

Predictive learning models for concept drift. - John Case; Sanjay Jain 001; Susanne Kaufmann; Arun Sharma 001; Frank Stephan 001 (Theor. Comput. Sci., 2001)

Synthesizing noise-tolerant language learners. - John Case; Sanjay Jain 001; Arun Sharma 001 (Theor. Comput. Sci., 2001)

Learning to Win Process-Control Games Watching Game-Masters. - John Case; Matthias Ott; Arun Sharma 001; Frank Stephan 001 (Inf. Comput., 2002)

Control structures in hypothesis spaces: the influence on learning. - John Case; Sanjay Jain 001; Mandayam Suraj (Theor. Comput. Sci., 2002)

Computing Entropy for Ortholog Detection. - Hsing-Kuo Pao; John Case (International Conference on Computational Intelligence, 2004)

A Polynomial Time Learner for a Subclass of Regular Patterns - John Case; Sanjay Jain 001; Rüdiger Reischuk; Frank Stephan 001; Thomas Zeugmann (Electron. Colloquium Comput. Complex., 2004)

On the classification of recursive languages. - John Case; Efim B. Kinber; Arun Sharma 001; Frank Stephan 001 (Inf. Comput., 2004)

Robust learning–rich and poor. - John Case; Sanjay Jain 001; Frank Stephan 001; Rolf Wiehagen (J. Comput. Syst. Sci., 2004)

Parsimony hierarchies for inductive inference. - Andris Ambainis; John Case; Sanjay Jain 001; Mandayam Suraj (J. Symb. Log., 2004)

Off-Loading Memory to the Environment: A Quantitative Example. - John Case (Minds Mach., 2004)

On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms. - John Case; Sanjay Jain 001; Franco Montagna; Giulia Simi; Andrea Sorbi (J. Comput. Syst. Sci., 2005)

Memory-Limited U-Shaped Learning. - Lorenzo Carlucci; John Case; Sanjay Jain 001; Frank Stephan 001 (COLT, 2006)

Generality's price: Inescapable deficiencies in machine-learned programs. - John Case; Keh-Jiann Chen; Sanjay Jain 001; Wolfgang Merkle; James S. Royer (Ann. Pure Appl. Log., 2006)

Identifying Clusters from Positive Data. - John Case; Sanjay Jain 001; Eric Martin 002; Arun Sharma 001; Frank Stephan 001 (SIAM J. Comput., 2006)

Learning a subclass of regular patterns in polynomial time. - John Case; Sanjay Jain 001; Rüdiger Reischuk; Frank Stephan 001; Thomas Zeugmann (Theor. Comput. Sci., 2006)

Feasible Iteration of Feasible Learning Functionals. - John Case; Timo Kötzing; Todd Paddock (ALT, 2007)

Cautious virus detection in the extreme. - John Case; Samuel E. Moelius (PLAS, 2007)

Results on memory-limited U-shaped learning. - Lorenzo Carlucci; John Case; Sanjay Jain 001; Frank Stephan 001 (Inf. Comput., 2007)

Foreword. - Shai Ben-David; John Case; Thomas Zeugmann (Theor. Comput. Sci., 2007)

Dynamically Delayed Postdictive Completeness and Consistency in Learning. - John Case; Timo Kötzing (ALT, 2008)

Dynamic Modeling in Inductive Inference. - John Case; Timo Kötzing (ALT, 2008)

Optimal Language Learning. - John Case; Samuel E. Moelius (ALT, 2008)

When unlearning helps. - Ganesh R. Baliga; John Case; Wolfgang Merkle; Frank Stephan 001; Rolf Wiehagen (Inf. Comput., 2008)

Non-U-shaped vacillatory and team learning. - Lorenzo Carlucci; John Case; Sanjay Jain 001; Frank Stephan 001 (J. Comput. Syst. Sci., 2008)

U-shaped, iterative, and iterative-with-counter learning. - John Case; Samuel E. Moelius (Mach. Learn., 2008)

Foreword. - John Case; Takeshi Shinohara; Thomas Zeugmann; Sandra Zilles (Theor. Comput. Sci., 2008)

Difficulties in Forcing Fairness of Polynomial Time Inductive Inference. - John Case; Timo Kötzing (ALT, 2009)

Independence Results for n-Ary Recursion Theorems. - John Case; Samuel E. Moelius (FCT, 2009)

Learning correction grammars. - Lorenzo Carlucci; John Case; Sanjay Jain 001 (J. Symb. Log., 2009)

Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems. - John Case (Theory Comput. Syst., 2009)

Characterizing Programming Systems Allowing Program Self-Reference. - John Case; Samuel E. Moelius (Theory Comput. Syst., 2009)

Parallelism increases iterative learning power. - John Case; Samuel E. Moelius (Theor. Comput. Sci., 2009)

Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations. - John Case; Timo Kötzing (ALT, 2010)

Strongly Non-U-Shaped Learning Results by General Techniques. - John Case; Timo Kötzing (COLT, 2010)

Iterative learning of simple external contextual languages. - Leonor Becerra-Bonache; John Case; Sanjay Jain 001; Frank Stephan 001 (Theor. Comput. Sci., 2010)

Connections Between Inductive Inference and Machine Learning. - John Case; Sanjay Jain 001 (Encyclopedia of Machine Learning, 2010)

Measuring Learning Complexity with Criteria Epitomizers. - John Case; Timo Kötzing (STACS, 2011)

Properties Complementary to Program Self-Reference. - John Case; Samuel E. Moelius (Fundam. Informaticae, 2011)

Optimal language learning from positive data. - John Case; Samuel E. Moelius (Inf. Comput., 2011)

Rice and Rice-Shapiro Theorems for transfinite correction grammars. - John Case; Sanjay Jain 001 (Math. Log. Q., 2011)

Automatic learning of subclasses of pattern languages. - John Case; Sanjay Jain 001; Trong Dao Le; Yuh Shin Ong; Pavel Semukhin; Frank Stephan 001 (Inf. Comput., 2012)

Learning secrets interactively. Dynamic modeling in inductive inference. - John Case; Timo Kötzing (Inf. Comput., 2012)

Algorithmic Scientific Inference: Within Our Computable Expected Reality? - John Case (Int. J. Unconv. Comput., 2012)

Program Self-Reference in Constructive Scott Subdomains. - John Case; Samuel E. Moelius (Theory Comput. Syst., 2012)

Beyond Rogers' Non-constructively Computable Function. - John Case; Michael Ralston (CiE, 2013)

Automatic functions, linear time and learning. - John Case; Sanjay Jain 001; Samuel Seah; Frank Stephan 001 (Log. Methods Comput. Sci., 2013)

Memory-limited non-U-shaped learning with solved open problems. - John Case; Timo Kötzing (Theor. Comput. Sci., 2013)

On the Necessity of U-Shaped Learning. - Lorenzo Carlucci; John Case (Top. Cogn. Sci., 2013)

Automatic learners with feedback queries. - John Case; Sanjay Jain 001; Yuh Shin Ong; Pavel Semukhin; Frank Stephan 001 (J. Comput. Syst. Sci., 2014)

Program Size Complexity of Correction Grammars in the Ershov Hierarchy. - John Case; James S. Royer (CiE, 2016)

Non-Obfuscated Unprovable Programs & Many Resultant Subtleties. - John Case; Michael Ralston (Log. Methods Comput. Sci., 2016)

Strongly non-U-shaped language learning results by general techniques. - John Case; Timo Kötzing (Inf. Comput., 2016)

Topological separations in inductive inference. - John Case; Timo Kötzing (Theor. Comput. Sci., 2016)

Connections Between Inductive Inference and Machine Learning. - John Case; Sanjay Jain 001 (Encyclopedia of Machine Learning and Data Mining, 2017)

Effectivity questions for Kleene's recursion theorem. - John Case; Sanjay Jain 001; Frank Stephan 001 (Theor. Comput. Sci., 2018)

Leveraging Iterative Design of Experiments to Innovate in a High-Risk Production Environment: A US Army Aviation Case Study. - Clay Woody; John Case; Dereck Kennedy; John Caddell (SysCon, 2020)

Constructivity conditions on immune sets. - John Case (Arch. Math. Log., 2025)