Stephan, Frank - Departments of Computer Science & Mathematics, National University of Singapore

• Automatic Structures: Richness and Limitations Bakhadyr Khoussainov # , Andre Nies + , Sasha Rubin # and Frank Stephan
• Inclusion Problems in Parallel Learning Martin Kummer \Lambda
• On the Structure of Degrees of Inferability Martin Kummer \Lambda
• Representation of LeftComputable #--Random Reals I
• Degrees of Computing and Learning Habilitationsschrift von Frank Stephan
• Enumerations of the Kolmogorov Function Richard Beigel a Harry Buhrman b Peter Fejer c
• Identifying Clusters from Positive Data # John Case 1 , Sanjay Jain 2 , Eric Martin 3 , Arun Sharma 4 and Frank Stephan 4
• Splitting of Learnable Classes Hongyang Li 1 and Frank Stephan 2
• Schnorr trivial sets and truthtable reducibility Johanna N.Y. Franklin # and Frank Stephan #
• [25] M. Kummer, F. Stephan. Some aspects of frequency computation. Technical Report Nr. 21/91, Fakultat fur Informatik, Universitat Karlsruhe, 1991.
• Department of Mathematics Honours Project Proposal
• Representation of LeftComputable #--Random Reals #
• The Complexity of Learning Branches and Strategies from Queries
• On the Classi cation of Computable Languages John Case
• Quantifying the Amount of Verboseness \Lambda Richard Beigel y
• Regular Patterns, Regular Languages and ContextFree Sanjay Jain #,1 and Yuh Shin Ong 1 and Frank Stephan ##,1,2
• Immunity and hyperimmunity for sets of minimal indices #
• TURING DEGREES AND THE ERSHOV HIERARCHY FRANK STEPHAN, YUE YANG AND LIANG YU
• Classification Using Information # William Gasarch +
• The Complexity of the Set of Nonrandom Numbers Frank Stephan
• Midterm Examination 2 MA 3205: Set Theory
• Midterm Examination 2 MA 3205: Set Theory
• Recursion Theory Frank Stephan
• A Polynomial Time Learner for a Subclass of Regular Patterns
• An incomplete set of shortest descriptions # Frank Stephan
• KolmogorovLoveland Randomness and Stochasticity
• Midterm Examination 1 MA 3205: Set Theory
• Structural Measures for Games and Process Control in the Branch Learning Model
• Automatic Linear Orders (Revised Version)
• How Powerful is Unconditional Transfer?
• Inductive versus approximative learning Wolfram Menzel and Frank Stephan
• Selftest for MA 3205 --Set Theory Matriculation Number: . Marking: Each question 1 mark.
• Recursion Theory Frank Stephan
• Learnability of Automatic Classes Sanjay Jain a,1 , Qinglong Luo b , Frank Stephan c,1
• UShaped Learning may be Necessary 3 Lorenzo Carlucci a,1 , John Case b,1 , Sanjay Jain c,2 ,
• Topological aspects of poset spaces Carl Mummert #
• Using random sets as oracles Denis R. Hirschfeldt #
• Mathematisches Forschungsinstitut Oberwolfach T a g u n g s b e r i c h t 3/2001
• Prescribed Learning of Indexed Families Sanjay Jain #1 , Frank Stephan #2 and Nan Ye 3
• Midterm Examination 1 MA 3205: Set Theory
• Lowness for Weakly 1Generic and KurtzRandom # Frank Stephan 1 and Liang Yu 2
• Uncountable Automatic Classes and Learning Sanjay Jain # , Qinglong Luo + , Pavel Semukhin # and Frank Stephan
• Midterm Examination 1 MA 3205: Set Theory
• VAN LAMBALGEN'S THEOREM AND HIGH DEGREES JOHANNA N.Y. FRANKLIN AND FRANK STEPHAN
• The Power of Frequency Computation (Extended Abstract)
• Constructive Dimension and Turing Degrees Laurent Bienvenu #
• Unifying Logic, Topology and Learning in Parametric Logic
• Avoiding Coding Tricks by Hyperrobust Learning
• On Automatic Families Sanjay Jain, Yuh Shin Ong, Shi Pu and Frank Stephan
• Automatic Structures and Model Theory Pavel Semukhin 1 and Frank Stephan 2
• Department of Mathematics Honours Project Proposal
• Hausdor#Dimension and Weak TruthTable Reducibility #
• Behavioural Approximations for Restricted Linear Di#erential Hybrid Automata
• Topological Aspects of Numberings W. Menzel F. Stephan y
• COMPUTABLE CATEGORICITY AND THE ERSHOV HIERARCHY
• UNIVERSAL RECURSIVELY ENUMERABLE SETS OF STRINGS
• Learning from Streams Sanjay Jain #1 , Frank Stephan ##2 and Nan Ye 3
• Midterm Examination 2 MA 3205: Set Theory
• Extremes in the Degrees of Inferability Lance Fortnow \Lambda
• Variations on Ushaped learning Lorenzo Carlucci a,1 Sanjay Jain b,2 Efim Kinber c
• Frank Stephan Semester I, Academic Year 2009-2010
• Frank Stephan Semester I, Academic Year 2009-2010
• Selftest for MA 3205 Set Theory Matriculation Number: . Marking: Each question 1 mark.
• Midterm Examination 2 MA 3205: Set Theory
• Consistent Partial Identification Sanjay Jain # and Frank Stephan +
• Approximable sets # Richard Beigel +
• Learning in Logic with RichProlog # Eric Martin 1 , Phuong Nguyen 1 , Arun Sharma 1 , and Frank Stephan 2
• Index Sets and Universal Numberings # Sanjay Jain 1 , Frank Stephan 2 and Jason Teutsch 3
• Einfuhrung in die Lerntheorie Privatdozent Dr. Frank Stephan
• Overview on the Research of Frank Stephan Frank Stephan
• Robust Learning Aided by Context \Lambda John Case Sanjay Jain Matthias Ott y
• [15] M. Kummer, F. Stephan. Some aspects of frequency computation. Technical Report Nr. 21/91, Fakultat fur Informatik, Universitat Karls
• POST'S PROGRAMME FOR THE ERSHOV HIERARCHY BAHAREH AFSHARI, GEORGE BARMPALIAS,
• Matroids and Learning Theory # Ziyuan Gao 1 , Frank Stephan 2 , Guohua Wu 3 and Akihiro Yamamoto 4
• Closed LeftR.E. Sets # Sanjay Jain 1 , Frank Stephan 1,2 and Jason Teutsch 3
• Iterative Learning of Simple External Contextual Languages
• Department of Mathematics Honours Project Proposal
• Robust learning of automatic classes of languages Sanjay Jain #1 and Eric Martin 2 and Frank Stephan ##3
• Midterm Examination 1 MA 3205: Set Theory
• Mitotic Classes in Inductive Inference Sanjay Jain #1 and Frank Stephan #2
• Mathematisches Forschungsinstitut Oberwolfach T a g u n g s b e r i c h t 5/1996
• When Unlearning Helps Ganesh Baliga 1 , John Case 2# , Wolfgang Merkle 3 , Frank Stephan 4## and Rolf Wiehagen 5
• Electronic Notes in Theoretical Computer Science 66 No. 1 (2002) URL: http://www.elsevier.nl/locate/entcs/volume66.html 17 pages
• ANTICOMPLEX SETS AND REDUCIBILITIES WITH TINY USE
• On CDegrees, HDegrees and TDegrees Wolfgang Merkle
• Generalized Notions of Mind Change Complexity Arun Sharma \Lambda
• Implementing Fragments of ZFC within an r.e. Universe # Eric Martin 1 , Wai Yan Pong 2 and Frank Stephan 3
• Relativizations of Randomness and Genericity Notions
• Results on MemoryLimited UShaped Learning Lorenzo Carlucci #1 John Case ##2 , Sanjay Jain # # #3 , Frank Stephan +4
• Applications of Kolmogorov Complexity to Computable Model Theory
• Language Learning from Texts: Mind Changes, Limited Memory and Monotonicity
• Kolmogorov Complexity and the Recursion Theorem
• Presentations of Ktrivial reals and Kolmogorov Complexity
• Numberings Optimal for Learning Sanjay Jain #1 and Frank Stephan #2
• 1 CLASSES, LR DEGREES AND TURING DEGREES GEORGE BARMPALIAS, ANDREW E.M. LEWIS AND FRANK STEPHAN
• Learning Classes of Approximations to NonRecursive Functions 1
• Learning to Win ProcessControl Games Watching GameMasters
• Some Recent Results in UShaped Learning Sanjay Jain #1 and Frank Stephan ##2
• Hierarchies of Randomness Tests Jan Reimann
• HIGHER KURTZ RANDOMNESS BJRN KJOSHANSSEN, ANDR
• A MINIMAL RKDEGREE Alexander Raichev and Frank Stephan
• Invertible Classes Sanjay Jain, 1 # Jochen Nessel 2 ## and Frank Stephan 3 # # #
• Recursion Theory Frank Stephan
• Department of Mathematics Honours Project Proposal
• Learning in Friedberg Numberings Sanjay Jain #1 and Frank Stephan #2
• On Ordinal VCDimension and Some Notions of Complexity
• Strong Reductions and Immunity for Exponential Time
• Resource Bounded Next Value and Explanatory Identification Learning Automata, Patterns and Polynomials OnLine \Lambda
• Pattern Learning Revisited Frank Stephan #,1 , Ryo Yoshinaka 2 and Thomas Zeugmann 2
• Finding Isolated Cliques by Queries --An Approach to Fault Diagnosis with Many Faults
• Prescribed Learning of R.E. Classes Sanjay Jain #1 , Frank Stephan #2 and Nan Ye 3
• A General Theory of Deduction, Induction, and Eric Martin 1 , Arun Sharma 1 , and Frank Stephan 2
• Frank Stephan Semester I, Academic Year 20092010
• Automata on Ordinals and Linear Orders # Philipp Schlicht 1 and Frank Stephan 2
• Automatic Learners with Feedback Queries John Case 1 , Sanjay Jain #,2 , Yuh Shin Ong 2 , Pavel Semukhin ##,3 and Frank Stephan # # #,2,4
• Automatic Learning of Subclasses of Pattern Languages John Case 1 , Sanjay Jain #,2 , Trong Dao Le 2 , Yuh Shin Ong 2 , Pavel Semukhin ##,3 and Frank
• On Intersections of R.E. and Random Sets # Johanna Franklin 1 and Frank Stephan 2
• A cohesive set which is not high Carl Jockusch #