Frank Stephan

发表

Learning a subclass of regular patterns in polynomial time

John Case, Sanjay Jain, Rüdiger Reischuk, 2006, Theor. Comput. Sci..

Frank Stephan, Wolfgang Merkle, F. Stephan, 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

Universal Recursively Enumerable Sets of Strings

Cristian S. Calude, Ludwig Staiger, André Nies, 2008, Developments in Language Theory.

Vacillatory and BC learning on noisy data

John Case, Sanjay Jain, Frank Stephan, 1996, Theor. Comput. Sci..

Automatic models of first order theories

Frank Stephan, Pavel Semukhin, 2013, Ann. Pure Appl. Log..

Inductive Inference

Sanjay Jain, Frank Stephan, Sanjay Jain, 2010, Encyclopedia of Machine Learning.

Finite state incompressible infinite sequences

Cristian S. Calude, Ludwig Staiger, Frank Stephan, 2016, Inf. Comput..

Finitely Generated Semiautomatic Groups

Sanjay Jain, Frank Stephan, Bakhadyr Khoussainov, 2016, CiE.

Theory and applications of models of computation : 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015 : proceedings

Frank Stephan, Rahul Jain, Sanjay Feb. Jain, 2015 .

Learning in Logic with RichProlog

Arun Sharma, Frank Stephan, Eric Martin, 2002, ICLP.

Algorithmic learning of probability distributions from random data in the limit pdf

George Barmpalias, Frank Stephan, F. Stephan, 2017, ArXiv.

Randomness and universal machines

Guohua Wu, Frank Stephan, Santiago Figueira, 2006, J. Complex..

Higher Kurtz randomness

André Nies, Frank Stephan, Liang Yu, 2010, Ann. Pure Appl. Log..

Topological aspects of numberings

Frank Stephan, Wolfram Menzel, 2003, Math. Log. Q..

Robust Learning with Infinite Additional Information

Frank Stephan, Susanne Kaufmann, 1997, EuroCOLT.

Inclusion problems in parallel learning and games (extended abstract)

Frank Stephan, Martin Kummer, F. Stephan, 1994, Annual Conference Computational Learning Theory.

On the role of update constraints and text-types in iterative learning

Sanjay Jain, Frank Stephan, Timo Kötzing, 2016, Inf. Comput..

Automatic Learners with Feedback Queries

John Case, Sanjay Jain, Frank Stephan, 2011, CiE.

Absolute versus probabilistic classification in a logical setting

Sanjay Jain, Frank Stephan, Eric Martin, 2005, Theoretical Computer Science.

Average-Case Complexity of Learning Polynomials

Frank Stephan, Thomas Zeugmann, 2000, COLT.

Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory

Frank Stephan, Bernd Borchert, 1997, Kurt Gödel Colloquium.

Hausdorff dimension in exponential time

Frank Stephan, Wolfgang Merkle, Klaus Ambos-Spies, 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

Automata on ordinals and automaticity of linear orders

Philipp Schlicht, Frank Stephan, F. Stephan, 2013, Ann. Pure Appl. Log..

Algorithmic Learning Theory, 17th International Conference, ALT 2006, Barcelona, Spain, October 7-10, 2006, Proceedings

Philip M. Long, José L. Balcázar, Frank Stephan, 2006, ALT.

Learning pattern languages over groups

Sanjay Jain, Frank Stephan, Rupert Hölzl, 2018, Theor. Comput. Sci..

An ordered approach to solving parity games in quasi polynomial time and quasi linear space

Sanjay Jain, Sven Schewe, John Fearnley, 2017, SPIN.

The Comlexity of OddAn

Frank Stephan, William I. Gasarch, Richard Beigel, 2000, J. Symb. Log..

Reducibilities among equivalence relations induced by recursively enumerable structures

Frank Stephan, Bakhadyr Khoussainov, Alex Gavryushkin, 2016, Theor. Comput. Sci..

On the structure of degrees of inferability

Frank Stephan, Martin Kummer, F. Stephan, 1993, COLT '93.

Learning Families of Closed Sets in Matroids

Akihiro Yamamoto, Guohua Wu, Frank Stephan, 2012, Computation, Physics and Beyond.

Urban Classification Using Full Spectral Information of Landsat ETM Imagery in Marion County , Indiana

Frank Stephan, William I. Gasarch, Mark G. Pleszkoch, 2005 .

Exact Satisfiabitity with Jokers

Sanjay Jain, Frank Stephan, Sibylle Schwarz, 2019, TAMC.

The Complexity of Verbal Languages over Groups

Sanjay Jain, Frank Stephan, Alexei G. Myasnikov, 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

Learning power and language expressiveness

Arun Sharma, Frank Stephan, Eric Martin, 2003, Theor. Comput. Sci..

Numberings optimal for learning

Sanjay Jain, Frank Stephan, 2010, J. Comput. Syst. Sci..

Constructive Dimension and Weak Truth-Table Degrees

Frank Stephan, Laurent Bienvenu, David Doty, 2007, CiE.

Arithmetic complexity via effective names for random sequences

Jason Teutsch, Frank Stephan, Bjørn Kjos-Hanssen, 2010, TOCL.

Equivalences between learning of data and probability distributions, and their applications pdf

George Barmpalias, Frank Stephan, Nan Fang, 2018, Inf. Comput..

Mitotic Classes in Inductive Inference

Sanjay Jain, Frank Stephan, 2008, SIAM J. Comput..

On General Sum Approximations of Irrational Numbers

Frank Stephan, Ivan Georgiev, Lars Kristiansen, 2018, CiE.

On the Query Complexity of Sets

Frank Stephan, William I. Gasarch, Richard Beigel, 1996, MFCS.

Automata on Ordinals and Linear Orders

Philipp Schlicht, Frank Stephan, 2011, CiE.

Predictive learning models for concept drift

John Case, Arun Sharma, Sanjay Jain, 2001, Theor. Comput. Sci..

Language Learning from Texts: Mindchanges, Limited Memory, and Monotonicity

Frank Stephan, Efim B. Kinber, 1995, Inf. Comput..

The Complexity of Learning Branches and Strategies from Queries

Frank Stephan, Matthias Ott, F. Stephan, 1997, ISAAC.

Automatic linear orders and trees

Frank Stephan, Sasha Rubin, Bakhadyr Khoussainov, 2005, TOCL.

On the Data Consumption Benefits of Accepting Increased Uncertainty

Arun Sharma, Frank Stephan, Eric Martin, 2004, ALT.

Lowness properties and approximations of the jump

André Nies, Frank Stephan, Santiago Figueira, 2008, Ann. Pure Appl. Log..

Robust learning--rich and poor

John Case, Rolf Wiehagen, Sanjay Jain, 2004, J. Comput. Syst. Sci..

How Powerful Are Integer-Valued Martingales?

Jason Teutsch, Frank Stephan, Laurent Bienvenu, 2010, Theory of Computing Systems.

Prescribed Learning of Indexed Families

Sanjay Jain, Frank Stephan, Nan Ye, 2008, Fundam. Informaticae.

The dot-depth and the polynomial hierarchies correspond on the delta levels

Frank Stephan, Denis Thérien, Klaus-Jörn Lange, 2005, Int. J. Found. Comput. Sci..

Quantifying the Amount of Verboseness

Frank Stephan, Richard Beigel, Martin Kummer, 1992, Inf. Comput..

The VC-Dimension of Subclasses of Pattern

Arun Sharma, Frank Stephan, Tobias Scheffer, 1999, ALT.

An incomplete set of shortest descriptions

Jason Teutsch, Frank Stephan, Jason Teutsch, 2012, The Journal of Symbolic Logic.

On the Role of Update Constraints and Text-Types in Iterative Learning

Sanjay Jain, Frank Stephan, Timo Kötzing, 2014, ALT.

Confident and consistent partial learning of recursive functions

Frank Stephan, Ziyuan Gao, F. Stephan, 2012, Theor. Comput. Sci..

On the amount of nonconstructivity in learning formal languages from text

Frank Stephan, Thomas Zeugmann, Sanjay Jain, 2020 .

Learning classes of approximations to non-recursive function

Frank Stephan, Thomas Zeugmann, T. Zeugmann, 2002, Theor. Comput. Sci..

When unlearning helps

John Case, Rolf Wiehagen, Frank Stephan, 2008, Inf. Comput..

Robust learning aided by context

John Case, Arun Sharma, Sanjay Jain, 1998, COLT' 98.

Limit-depth and DNR degrees

Frank Stephan, Philippe Moser, 2018, Inf. Process. Lett..

On the Help of Bounded Shot Verifiers, Comparators and Standardisers for Learnability in Inductive Inference

Sanjay Jain, Frank Stephan, Thomas Zeugmann, 2018, ALT.

Selection by Recursively Enumerable Sets

Wei Wang, Jason Teutsch, Yue Yang, 2013, TAMC.

Editors' Introduction

Sanjay Jain, Frank Stephan, Thomas Zeugmann, 1997, First Monday.

Inductive inference and reverse mathematics

Sanjay Jain, Frank Stephan, Rupert Hölzl, 2016, Ann. Pure Appl. Log..

Closure of resource-bounded randomness notions under polynomial time permutations pdf

André Nies, Frank Stephan, 2018, STACS.

Partial learning of recursively enumerable languages

Frank Stephan, Sandra Zilles, Ziyuan Gao, 2016, Theor. Comput. Sci..

Algorithmic Learning Theory, 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings

Frank Stephan, Thomas Zeugmann, Vladimir Vovk, 2010, ALT.

Semiautomatic Structures

Sanjay Jain, Frank Stephan, Bakhadyr Khoussainov, 2017, Theory of Computing Systems.

Approximable Sets

Frank Stephan, Richard Beigel, Martin Kummer, 1995, Inf. Comput..

On the learnability of vector spaces

Frank Stephan, Valentina S. Harizanov, 2007, J. Comput. Syst. Sci..

On block pumpable languages

Rusins Freivalds, Frank Stephan, Christopher Hanrui Chak, 2016, Theor. Comput. Sci..

Proceedings of the 24th International Conference on Algorithmic Learning Theory - Volume 8139

Frank Stephan, Thomas Zeugmann, Sanjay Jain, 2013 .

Input-Dependence in Function-Learning

Sanjay Jain, Frank Stephan, Eric Martin, 2009, Theory of Computing Systems.

Anti-Complex Sets and Reducibilities with Tiny Use

Guohua Wu, Johanna N. Y. Franklin, Frank Stephan, 2011, The Journal of Symbolic Logic.

Confident and Consistent Partial Learning of Recursive Functions

Frank Stephan, Ziyuan Gao, F. Stephan, 2012, ALT.

A Polynomial Time Learner for a Subclass of Regular Patterns

John Case, Sanjay Jain, Rüdiger Reischuk, 2004, Electron. Colloquium Comput. Complex..

Query-Based Learning

Sanjay Jain, Frank Stephan, Sanjay Jain, 2010, Encyclopedia of Machine Learning and Data Mining.

On existentially first-order definable languages and their relation to NP

Frank Stephan, Dietrich Kuske, Bernd Borchert, 1999, RAIRO Theor. Informatics Appl..

Automatic Learning from Positive Data and Negative Counterexamples

Sanjay Jain, Frank Stephan, Efim B. Kinber, 2006, International Conference on Algorithmic Learning Theory.

Approximable sets

Frank Stephan, Richard Beigel, Martin Kummer, 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

Computable categoricity and the Ershov hierarchy

Yue Yang, Frank Stephan, Bakhadyr Khoussainov, 2008, Ann. Pure Appl. Log..

A Cohesive Set which is not High

Frank Stephan, Carl G. Jockusch, F. Stephan, 1993, Math. Log. Q..

Structural Measures for Games and Process Control in the Branch Learning Model

Frank Stephan, Matthias Ott, 1997, EuroCOLT.

Learners Based on Transducers

Sanjay Jain, Frank Stephan, Eric Martin, 2018, LATA.

Lowness Properties and Approximations of the Jump

André Nies, Frank Stephan, Santiago Figueira, 2006, Electron. Notes Theor. Comput. Sci..

Initial segment complexities of randomness notions

Guohua Wu, Frank Stephan, Rupert Hölzl, 2014, Inf. Comput..

Weakly Semirecursive Sets and r.e. Orderings

Frank Stephan, Martin Kummer, 1993, Ann. Pure Appl. Log..

Invertible Classes

Sanjay Jain, Frank Stephan, Jochen Nessel, 2006, TAMC.

Guest Editors' foreword

Sanjay Jain, Frank Stephan, Thomas Zeugmann, 2016, Theor. Comput. Sci..

Trivial Reals

André Nies, Frank Stephan, Rodney G. Downey, 2002, CCA.

Learning Pattern Languages over Groups

Sanjay Jain, Frank Stephan, Rupert Hölzl, 2016, ALT.

On ordinal VC-dimension and some notions of complexity

Arun Sharma, Frank Stephan, Eric Martin, 2006, Theor. Comput. Sci..

Post's Programme for the Ershov Hierarchy

George Barmpalias, Frank Stephan, S. Barry Cooper, 2007, J. Log. Comput..

Learning and classifying

Sanjay Jain, Frank Stephan, Eric Martin, 2013, Theor. Comput. Sci..

Iterative learning of simple external contextual languages

Leonor Becerra-Bonache, John Case, Sanjay Jain, 2008, Theor. Comput. Sci..

Van Lambalgen's Theorem and High Degrees

Johanna N. Y. Franklin, Frank Stephan, 2011, Notre Dame J. Formal Log..

Invertible classes

Sanjay Jain, Frank Stephan, Jochen Nessel, 2007, Theor. Comput. Sci..

Consistent Partial Identification

Sanjay Jain, Frank Stephan, Sanjay Jain, 2009, COLT.

Refuting Learning Revisited

Frank Stephan, Wolfgang Merkle, 2001, ALT.

On the structure of degrees of inferability

Frank Stephan, Martin Kummer, F. Stephan, 1993, COLT '93.

Learnability of Automatic Classes

Sanjay Jain, Frank Stephan, Qinglong Luo, 2010, LATA.

Identifying Clusters from Positive Data

John Case, Arun Sharma, Sanjay Jain, 2006, SIAM J. Comput..

Semiautomatic Structures

Sanjay Jain, Frank Stephan, Bakhadyr Khoussainov, 2017, Theory of Computing Systems.

Infinitely-Often Autoreducible Sets

Lance Fortnow, Frank Stephan, Richard Beigel, 2003, ISAAC.

Closed left-r.e. sets

Sanjay Jain, Jason Teutsch, Frank Stephan, 2017, Comput..

On the data consumption benefits of accepting increased uncertainty

Arun Sharma, Frank Stephan, Eric Martin, 2007, Theor. Comput. Sci..

Prescribed Learning of R.E. Classes

Sanjay Jain, Frank Stephan, Nan Ye, 2007, ALT.

Memory-Limited U-Shaped Learning

John Case, Sanjay Jain, Frank Stephan, 2006, COLT.

Inclusion Problems in Parallel Learning and Games

Frank Stephan, Martin Kummer, 1996, J. Comput. Syst. Sci..

Structural measures for games and process control in the branch learning model

Frank Stephan, Matthias Ott, F. Stephan, 1997, Theor. Comput. Sci..

Automatic Functions, Linear Time and Learning

John Case, Sanjay Jain, Frank Stephan, 2012, CiE.

Automatic structures: richness and limitations

André Nies, Frank Stephan, Sasha Rubin, 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

Learning Automatic Families of Languages

Sanjay Jain, Frank Stephan, Sanjay Jain, 2016, SOFSEM.

Editors' Introduction

Frank Stephan, Thomas Zeugmann, Vladimir Vovk, 2010, ALT.

Infinitely-Often Autoreducible Sets

Lance Fortnow, Frank Stephan, Richard Beigel, 2006, SIAM J. Comput..

The Complexity of Universal Text-Learners

Frank Stephan, Sebastiaan Terwijn, 1997, FCT.

Classes with Easily Learnable Subclasses

Sanjay Jain, Frank Stephan, Wolfram Menzel, 2002, ALT.

Guest Editors' foreword

Frank Stephan, Thomas Zeugmann, Vladimir Vovk, 2013, Theor. Comput. Sci..

Complexity of Inductive Inference

Sanjay Jain, Frank Stephan, 2010, Encyclopedia of Machine Learning.

Kolmogorov-Loveland randomness and stochasticity

André Nies, Frank Stephan, Wolfgang Merkle, 2005, Ann. Pure Appl. Log..

Recursion Theoretic Properties of Frequency Computation and Bounded Queries (Extended Abstract)

Frank Stephan, Martin Kummer, F. Stephan, 1993, Kurt Gödel Colloquium.

Logic Colloquium 2007: Introduction

Frank Stephan, Ulrich Kohlenbach, Penelope Maddy, 2010 .

Quantifying the Amount of Verboseness

Frank Stephan, Richard Beigel, Martin Kummer, 1995, Inf. Comput..

Behavioural Approximations for Restricted Linear Differential Hybrid Automata

Frank Stephan, P. S. Thiagarajan, Shaofa Yang, 2006, HSCC.

Automatic learners with feedback queries

John Case, Sanjay Jain, Frank Stephan, 2014, J. Comput. Syst. Sci..

Index Sets and Universal Numberings

Sanjay Jain, Jason Teutsch, Frank Stephan, 2009, CiE.

Special issue on the conference Theory and Applications of Models of Computation

Rahul Jain, Sanjay Jain, Frank Stephan, 2017, Inf. Comput..

Randomness and Solovay degrees

André Nies, Frank Stephan, Kenshi Miyabe, 2018, J. Log. Anal..

Automatic linear orders and trees (Revised)

Frank Stephan, Sasha Rubin, Bakhadyr Khoussainov, 2003 .

Algorithmic learning theory : 24th International Conference, ALT 2013, Singapore, October 6-9, 2013, proceedings

Frank Stephan, Thomas Zeugmann, Sanjay Jain, 2013 .

ON AUTOMATIC FAMILIES

Sanjay Jain, Frank Stephan, Shi Pu, 2011 .

Covering the Recursive Sets

Frank Stephan, Sebastiaan Terwijn, Bjørn Kjos-Hanssen, 2015, CiE.

Learning by switching type of information

Sanjay Jain, Frank Stephan, 2003, Inf. Comput..

Looking for an Analogue of Rice's Theorem in Complexity Theory

Frank Stephan, Bernd Borchert, 1996, Electron. Colloquium Comput. Complex..

How Powerful is Unconditional Transfer? - When UT meets AC

Henning Fernau, Frank Stephan, F. Stephan, 1997, Developments in Language Theory.

Counting Extensional Differences in BC-Learning

Frank Stephan, Sebastiaan Terwijn, 2000, ICGI.

I classes, LR degrees and Turing degrees

George Barmpalias, Frank Stephan, Andrew E. M. Lewis, 2008, Ann. Pure Appl. Log..

Learning to Win Process-Control Games Watching Game-Masters

John Case, Arun Sharma, Frank Stephan, 1998, Inf. Comput..

Unifying logic, topology and learning in Parametric logic

Arun Sharma, Frank Stephan, Eric Martin, 2006, Theor. Comput. Sci..

Correction to "A Cohesive Set which is not High"

Frank Stephan, Carl G. Jockusch, 1997, Math. Log. Q..

Algorithmic Aspects of Lipschitz Functions

André Nies, Frank Stephan, Bjørn Kjos-Hanssen, 2014, Comput..

On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions

Desh Ranjan, Frank Stephan, Bernd Borchert, 1998, Theory of Computing Systems.

Randomness, relativization and Turing degrees

André Nies, Frank Stephan, Sebastiaan Terwijn, 2005, J. Symb. Log..

Counting extensional differences in BC-learning

Sanjay Jain, Frank Stephan, Sebastiaan Terwijn, 2004, Inf. Comput..

The isomorphism problem for tree-automatic ordinals with addition

Philipp Schlicht, Sanjay Jain, Frank Stephan, 2018, Inf. Process. Lett..

Resource bounded next value and explanatory identification: learning automata, patterns and polynomials on-line

Frank Stephan, Susanne Kaufmann, 1997, COLT '97.

Learning via queries and oracles

Frank Stephan, 1995, COLT '95.

Definability and Regularity in Automatic Structures

Frank Stephan, Sasha Rubin, Bakhadyr Khoussainov, 2004, STACS.

Kolmogorov-Loveland Randomness and Stochasticity

André Nies, Frank Stephan, Wolfgang Merkle, 2005, STACS.

Enlarging Learnable Classes

Sanjay Jain, Frank Stephan, Timo Kötzing, 2012, ALT.

On the classification of recursive languages

John Case, Arun Sharma, Frank Stephan, 2004, Inf. Comput..

Recursion Theoretic Properties of Frequency Computation and Bounded Queries

Frank Stephan, Martin Kummer, F. Stephan, 1995, Inf. Comput..

Initial Segment Complexities of Randomness Notions

Guohua Wu, Frank Stephan, Rupert Hölzl, 2010, IFIP TCS.

Automatic Learning from Repetitive Texts

Philipp Schlicht, Sanjay Jain, Frank Stephan, 2017, ALT.

Uncountable Automatic Classes and Learning

Sanjay Jain, Frank Stephan, Pavel Semukhin, 2009, ALT.

Learning How to Separate

Sanjay Jain, Frank Stephan, Sanjay Jain, 2001, ALT.

Effectivity Questions for Kleene's Recursion Theorem

John Case, Sanjay Jain, Frank Stephan, 2013, LFCS.

Things that can be made into themselves

Jason Teutsch, Frank Stephan, Jason Teutsch, 2012, Inf. Comput..

Random Subgroups of Rationals

Sanjay Jain, Frank Stephan, Bakhadyr Khoussainov, 2019, MFCS.

Covering the recursive sets

Frank Stephan, Sebastiaan Terwijn, Bjørn Kjos-Hanssen, 2015, Ann. Pure Appl. Log..

Inductive Inference

Sanjay Jain, Frank Stephan, Sanjay Jain, 2010, Encyclopedia of Machine Learning.

Robust Learning - Rich and Poor

John Case, Rolf Wiehagen, Sanjay Jain, 2001, COLT/EuroCOLT.

Graphs realised by r.e. equivalence relations

Sanjay Jain, Frank Stephan, Bakhadyr Khoussainov, 2014, Ann. Pure Appl. Log..

Learning Algebraic Structures from Text Using Semantical Knowledge

Frank Stephan, Yuri Ventsov, 1998, ALT.

On one-sided versus two-sided classification

Frank Stephan, F. Stephan, 2001, Arch. Math. Log..

Learning in Friedberg Numberings

Sanjay Jain, Frank Stephan, 2007, ALT.

Measure, Category and Learning Theory

Stuart A. Kurtz, Carl H. Smith, Rusins Freivalds, 1995, ICALP.

Variations on U-shaped learning

Sanjay Jain, Frank Stephan, Efim B. Kinber, 2006, Inf. Comput..

Deduction, Induction, and beyond in Parametric Logic

Arun Sharma, Frank Stephan, Eric Martin, 2007, Induction, Algorithmic Learning Theory, and Philosophy.

Variations on U-Shaped Learning

Sanjay Jain, Frank Stephan, Efim B. Kinber, 2005, COLT.

Learning, Logic, and Topology in a Common Framework

Arun Sharma, Frank Stephan, Eric Martin, 2002, ALT.

Immunity and Hyperimmunity for Sets of Minimal Indices

Jason Teutsch, Frank Stephan, 2008, Notre Dame J. Formal Log..

Finitely generated semiautomatic groups

Sanjay Jain, Frank Stephan, Bakhadyr Khoussainov, 2018, Comput..

Degrees of Weakly Computable Reals

Guohua Wu, Frank Stephan, Keng Meng Ng, 2006, CiE.

Generalized notions of mind change complexity

Arun Sharma, Frank Stephan, Yuri Ventsov, 1997, COLT '97.

Learning and classifying

Sanjay Jain, Frank Stephan, Eric Martin, 2011, Theor. Comput. Sci..

U-shaped learning may be necessary 3

John Case, Frank Stephan, Sanjay Jain, 2004 .

Automatic Learning of Subclasses of Pattern Languages

John Case, Sanjay Jain, Frank Stephan, 2011, LATA.

Iterative learning of simple external contextual languages

Leonor Becerra-Bonache, John Case, Sanjay Jain, 2010, Theor. Comput. Sci..

Cone avoidance and randomness preservation

Frank Stephan, Stephen G. Simpson, S. G. Simpson, 2015, Ann. Pure Appl. Log..

A reducibility related to being hyperimmune-free

Frank Stephan, Liang Yu, 2014, Ann. Pure Appl. Log..

Learning with ordinal-bounded memory from positive data

Sanjay Jain, Frank Stephan, Lorenzo Carlucci, 2012, J. Comput. Syst. Sci..

The complexity of oddan

Frank Stephan, Richard Beigel, Martin Kummer, 2000 .

Universal recursively enumerable sets of strings

Cristian S. Calude, Ludwig Staiger, André Nies, 2011, Theor. Comput. Sci..

The Complexity of Universal Text-Learners

Frank Stephan, Sebastiaan Terwijn, F. Stephan, 1997, Inf. Comput..

Deterministic Frequency Pushdown Automata

Rusins Freivalds, Cristian S. Calude, Sanjay Jain, 2015, J. Univers. Comput. Sci..

Learning to Win Process-Control Games Watching Game-Masters

John Case, Arun Sharma, Frank Stephan, 1998, ALT.

Editors' Introduction

Philip M. Long, José L. Balcázar, Frank Stephan, 2006, ALT.

On the Learnability of Vector Spaces

Frank Stephan, Valentina S. Harizanov, 2002, ALT.

On Existentially First-Order Definable Languages and Their Relation to NP

Frank Stephan, Dietrich Kuske, Bernd Borchert, 1998, ICALP.

Representation of left-computable ε-random reals

Cristian S. Calude, Frank Stephan, Nicholas J. Hay, 2011, J. Comput. Syst. Sci..

On the Parameterised Complexity of Learning Patterns

Ryo Yoshinaka, Frank Stephan, Thomas Zeugmann, 2011, ISCIS.

Automatic functions, linear time and learning

John Case, Sanjay Jain, Frank Stephan, 2013, Log. Methods Comput. Sci..

Lowness for Weakly 1-generic and Kurtz-Random

Frank Stephan, Liang Yu, F. Stephan, 2006, TAMC.

Trees and learning

Frank Stephan, Wolfgang Merkle, 2004, J. Comput. Syst. Sci..

Uncountable automatic classes and learning

Sanjay Jain, Frank Stephan, Pavel Semukhin, 2009, Theor. Comput. Sci..

Results on memory-limited U-shaped learning

John Case, Sanjay Jain, Frank Stephan, 2007, Inf. Comput..

The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels

Frank Stephan, Denis Thérien, Klaus-Jörn Lange, 2004, Developments in Language Theory.

Depth, Highness and DNR degrees

Frank Stephan, Philippe Moser, F. Stephan, 2015, Discret. Math. Theor. Comput. Sci..

Finding Isolated Cliques by Queries -- An Approach to Fault Diagnosis with Many Faults

Frank Stephan, William I. Gasarch, W. Gasarch, 2004, Algebraic Methods in Computational Complexity.

Mitotic Classes

Sanjay Jain, Frank Stephan, 2007, COLT.

Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory

Frank Stephan, Bernd Borchert, F. Stephan, 1997, Math. Log. Q..

On the Relative Sizes of Learnable Sets

Stuart A. Kurtz, Carl H. Smith, Rusins Freivalds, 1998, Theor. Comput. Sci..

On the Values for Factor Complexity

Ludwig Staiger, Frank Stephan, Birzhan Moldagaliyev, 2018, CIAA.

Partial functions and domination

Frank Stephan, Chi Tat Chong, Gordon Hoi, 2015, Log. Methods Comput. Sci..

Weakly Represented Families in Reverse Mathematics

Jing Zhang, Frank Stephan, Rupert Hölzl, 2017, Computability and Complexity.

Robust learning of automatic classes of languages

Sanjay Jain, Frank Stephan, Eric Martin, 2014, J. Comput. Syst. Sci..

Automatic structures: richness and limitations

André Nies, Frank Stephan, Sasha Rubin, 2004, LICS 2004.

Absolute Versus Probabilistic Classification in a Logical Setting

Sanjay Jain, Frank Stephan, Eric Martin, 2005, ALT.

The Complexity of Verbal Languages over Groups

Sanjay Jain, Frank Stephan, Alexei G. Myasnikov, 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

Searching for shortest and least programs

Sanjay Jain, Frank Stephan, Wolfgang Merkle, 2020, Theor. Comput. Sci..

On Ordinal VC-Dimension and Some Notions of Complexity

Arun Sharma, Frank Stephan, Eric Martin, 2003, ALT.

Tree-automatic scattered linear orders

Philipp Schlicht, Sanjay Jain, Frank Stephan, 2016, Theor. Comput. Sci..

Computational Complexity of Learning

Sanjay Jain, Frank Stephan, 2017, Encyclopedia of Machine Learning and Data Mining.

The Complexity of Recursive Splittings of Random Sets

André Nies, Frank Stephan, Keng Meng Ng, 2014, Comput..

Learning how to separate

Sanjay Jain, Frank Stephan, 2004, Theor. Comput. Sci..

A Tour of Robust Learning

Sanjay Jain, Frank Stephan, Sanjay Jain, 2003 .

On Martin's pointed tree theorem

Frank Stephan, Liang Yu, Rupert Hölzl, 2014, Comput..

Schnorr trivial sets and truth-table reducibility

Johanna N. Y. Franklin, Frank Stephan, F. Stephan, 2010, The Journal of Symbolic Logic.

Non U-Shaped Vacillatory and Team Learning

John Case, Sanjay Jain, Frank Stephan, 2005, ALT.

Avoiding coding tricks by hyperrobust learning

Frank Stephan, Matthias Ott, F. Stephan, 1999, Theor. Comput. Sci..

Regular patterns, regular languages and context-free languages

Sanjay Jain, Frank Stephan, Yuh Shin Ong, 2010, Inf. Process. Lett..

On the Uniform Learnability of Approximations to Non-Recursive Functions

Frank Stephan, Thomas Zeugmann, T. Zeugmann, 1999, ALT.

Extremes in the Degrees of Inferability

Stuart A. Kurtz, Lance Fortnow, Sanjay Jain, 1994, Ann. Pure Appl. Log..

An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space

Sanjay Jain, Sven Schewe, John Fearnley, 2017, International Journal on Software Tools for Technology Transfer.

Learning in Friedberg numberings

Sanjay Jain, Frank Stephan, Sanjay Jain, 2008, Inf. Comput..

Query-Based Learning

Sanjay Jain, Frank Stephan, 2017, Encyclopedia of Machine Learning and Data Mining.

On the structures inside truth-table degrees

Frank Stephan, F. Stephan, 2001, Journal of Symbolic Logic.

Constructive Dimension and Turing Degrees

Frank Stephan, Laurent Bienvenu, David Doty, 2009, Theory of Computing Systems.

The Power of Frequency Computation (Extended Abstract)

Frank Stephan, Martin Kummer, F. Stephan, 1995, FCT.

Effectivity questions for Kleene's recursion theorem

John Case, Sanjay Jain, Frank Stephan, 2018, Theor. Comput. Sci..

Priced Learning

Sanjay Jain, Frank Stephan, Junqi Ma, 2015, ALT.

Deciding parity games in quasipolynomial time

Cristian S. Calude, Sanjay Jain, Frank Stephan, 2017, STOC.

A General Theory of Deduction, Induction, and Learning

Arun Sharma, Frank Stephan, Eric Martin, 2001, Discovery Science.

Index sets and universal numberings

Sanjay Jain, Jason Teutsch, Frank Stephan, 2009, J. Comput. Syst. Sci..

Prescribed learning of r.e. classes

Sanjay Jain, Frank Stephan, Nan Ye, 2009, Theor. Comput. Sci..

Learnability of automatic classes

Sanjay Jain, Frank Stephan, Qinglong Luo, 2012, J. Comput. Syst. Sci..

Avoiding Coding Tricks by Hyperrobust Learning

Frank Stephan, Matthias Ott, 1999, EuroCOLT.

Vacillatory and BC learning on noisy data

John Case, Sanjay Jain, Frank Stephan, 1996, Theor. Comput. Sci..

Splitting of Learnable Classes

Frank Stephan, Hongyang Li, 2010, ICGI.

Effective Search Problems

Frank Stephan, Martin Kummer, F. Stephan, 1994, Math. Log. Q..

Learning a subclass of regular patterns in polynomial time

John Case, Sanjay Jain, Rüdiger Reischuk, 2006, Theor. Comput. Sci..

Automatic Structures: Richness and Limitations

André Nies, Frank Stephan, Sasha Rubin, 2004, LICS.

Language learning from texts (extended abstract): mind changes, limited memory and monotonicity

Frank Stephan, Efim B. Kinber, 1995, COLT '95.

Trees and learning

Frank Stephan, Wolfgang Merkle, 1996, COLT '96.

Complexity of Inductive Inference

Sanjay Jain, Frank Stephan, Sanjay Jain, 2017, Encyclopedia of Machine Learning and Data Mining.

Implementing fragments of ZFC within an r.e. Universe

Frank Stephan, Eric Martin, F. Stephan, 2018, J. Log. Comput..

Enumerations of the Kolmogorov function

Lance Fortnow, Frank Stephan, Harry Buhrman, 2006, Journal of Symbolic Logic.

How to verify computation with a rational network pdf

Sanjay Jain, Jason Teutsch, Frank Stephan, 2016, ArXiv.

Presentations of K-Trivial Reals and Kolmogorov Complexity

Guohua Wu, Frank Stephan, F. Stephan, 2005, CiE.

Classes with easily learnable subclasses

Sanjay Jain, Frank Stephan, Wolfram Menzel, 2004, Inf. Comput..

Strong Reductions and Immunity for Exponential Time

Frank Stephan, Marcus Schaefer, 2003, STACS.

The Discrete Time Behaviour of Restricted Linear Hybrid Automata

Frank Stephan, P. S. Thiagarajan, Shaofa Yang, 2012, Modern Applications of Automata Theory.

Input-Dependence in Function-Learning

Sanjay Jain, Frank Stephan, Eric Martin, 2007, CiE.

Robust learning with infinite additional information

Frank Stephan, Susanne Kaufmann, F. Stephan, 2001, Theor. Comput. Sci..

Robust Learning of Automatic Classes of Languages

Sanjay Jain, Frank Stephan, Eric Martin, 2011, ALT.

Highness, locally noncappability and nonboundings

Guohua Wu, Frank Stephan, 2013, Ann. Pure Appl. Log..

Finite state incompressible infinite sequences

Cristian S. Calude, Ludwig Staiger, Frank Stephan, 2014, Inf. Comput..

Combining Models of Approximation with Partial Learning

Frank Stephan, Sandra Zilles, Ziyuan Gao, 2015, ALT.

Automatic Learning of Subclasses of Pattern Languages

John Case, Sanjay Jain, Frank Stephan, 2011, LATA.

Learning by Switching Type of Information

Sanjay Jain, Frank Stephan, 2001, ALT.

Characterizations of Recursively Enumerable Languages by Programmed Grammars With Unconditional Transfer

Henning Fernau, Frank Stephan, 1999, J. Autom. Lang. Comb..

Partial Learning of Recursively Enumerable Languages

Frank Stephan, Sandra Zilles, Ziyuan Gao, 2013, ALT.

Computational Complexity of Learning

Sanjay Jain, Frank Stephan, Sanjay Jain, 2010, Encyclopedia of Machine Learning.

Numberings Optimal for Learning

Sanjay Jain, Frank Stephan, 2008, ALT.

On the Amount of Nonconstructivity in Learning Formal Languages from Positive Data

Sanjay Jain, Frank Stephan, Thomas Zeugmann, 2012, TAMC.

Applications of Kolmogorov complexity to computable model theory

Frank Stephan, Pavel Semukhin, Bakhadyr Khoussainov, 2007, J. Symb. Log..

Predictive Learning Models for Concept Drift

John Case, Arun Sharma, Sanjay Jain, 1998, ALT.

Learning algebraic structures from text

Frank Stephan, Yuri Ventsov, 2001, Theor. Comput. Sci..

Some Recent Results in U-Shaped Learning

Sanjay Jain, Frank Stephan, Sanjay Jain, 2006, TAMC.

Noisy Inference and Oracles

Frank Stephan, F. Stephan, 1995, Theor. Comput. Sci..

Enlarging learnable classes

Sanjay Jain, Frank Stephan, Timo Kötzing, 2016, Inf. Comput..

Inductive Inference and Reverse Mathematics

Sanjay Jain, Frank Stephan, Rupert Hölzl, 2015, STACS.

Learnability of Co-r.e. Classes

Frank Stephan, Ziyuan Gao, 2012, LATA.

Learning from Streams

Sanjay Jain, Frank Stephan, Nan Ye, 2009, ALT.

Learning via Queries and Oracles

Frank Stephan, 1998, Ann. Pure Appl. Log..

On Conservative Learning of Recursively Enumerable Languages

Sanjay Jain, Frank Stephan, Ziyuan Gao, 2013, CiE.

Refuting Learning Revisited

Frank Stephan, Wolfgang Merkle, F. Stephan, 2001, Theor. Comput. Sci..

Closed Left-R.E. Sets

Sanjay Jain, Jason Teutsch, Frank Stephan, 2011, TAMC.

Noisy Inference and Oracles

Frank Stephan, 1997, Theor. Comput. Sci..

Alternating Automatic Register Machines pdf

Frank Stephan, Ziyuan Gao, Ammar Fathin Sabili, 2021, ArXiv.

A Computation Model with Automatic Functions and Relations as Primitive Operations pdf

Frank Stephan, Ammar F. Sabili, Ammar Fathin Sabili, 2022, Theor. Comput. Sci..

Improved Algorithms for the General Exact Satisfiability Problem

Frank Stephan, Gordon Hoi, 2021, Theor. Comput. Sci..

Addition Machines, Automatic Functions and Open Problems of Floyd and Knuth pdf

Frank Stephan, Ammar Fathin Sabili, Xiaodong Jia, 2021, ArXiv.

Learnability and Positive Equivalence Relations pdf

Sanjay Jain, Frank Stephan, Ziyuan Gao, 2021, LATA.

On a Question of Ambos-Spies and Kucera

André Nies, Frank Stephan, Bjrn Kjos-Hanssen, 2003 .

The Complexity of the Set of Nonrandom Numbers

Frank Stephan, 2007 .

Relativizations of randomness and genericity notions

Johanna N. Y. Franklin, Frank Stephan, Liang Yu, 2011 .

Pillay's conjecture and its solution—a survey

Ya'acov Peterzil, Frank Stephan, Ulrich Kohlenbach, 2010 .

Models and Computability: A Techniques Oriented Survey of Bounded Queries

Frank Stephan, William Gasarch, 1999 .

Automatic Structures — Recent Results and Open Questions

Frank Stephan, 2015 .

The complexity of ODDnA

Frank Stephan, Richard Beigel, Martin Kummer, 2000, Journal of Symbolic Logic.

TURING DEGREES AND THE ERSHOV HIERARCHY

Frank Stephan, Liang Yu, Yue Yang, 2009 .

Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory

Frank Stephan, Bernd Borchert, 2000 .

Hausdorff-dimension and weak truth-table reducibility

Frank Stephan, Keith A. Kearnes, Alessandro Andretta, 2007 .

Subrecursive Approximations of Irrational Numbers by Variable Base Sums

Frank Stephan, Lars Kristiansen, Ivan Georgiev, 2018, 1804.05330.

Language Learning from Texts: Mind Changes, Limited Memory and Monotonicity (Extended Abstract).

Frank Stephan, Efim Kinber, Frank Stephan, 1995, COLT 1995.

Topological aspects of poset spaces

Frank Stephan, Carl Mummert, 2009 .

Using random sets as oracles

André Nies, Frank Stephan, Denis R. Hirschfeldt, 2007 .

Martin-Löf random and PA-complete sets

Frank Stephan, Peter Koepke, Wolfram Pohlers, 2016 .