Browsing by Author STEPHAN,FRANK CHRISTIAN

Select a letter below to browse by last name or type
0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z


Showing results 30 to 49 of 106 < previous   next >
Issue DateTitleAuthor(s)
2010How powerful are integer-valued martingales?Bienvenu, L.; Stephan, F. ; Teutsch, J.
Oct-2012How Powerful Are Integer-Valued Martingales?Bienvenu, L.; Stephan, F. ; Teutsch, J.
2004Identifying clusters from positive dataCase, J.; Jain, S. ; Martin, E.; Sharma, A.; Stephan, F. 
2006Identifying clusters from positive dataCase, J.; Jain, S. ; Martin, E.; Sharma, A.; Stephan, F. 
2008Immunity and hyperimmunity for sets of minimal indicesStephan, F. ; Teutsch, J.
2009Index sets and universal numberingsJain, S. ; Stephan, F. ; Teutsch, J.
Jul-2011Index sets and universal numberingsJain, S. ; Stephan, F. ; Teutsch, J.
2015Inductive inference and reverse mathematicsHolzl R; Jain S ; Stephan F 
2006Infinitely-often autoreducible setsBeigel, R.; Fortnow, L.; Stephan, F. 
2010Initial segment complexities of randomness notionsHölzl, R.; Kräling, T.; Stephan, F. ; Wu, G.
Feb-2014Initial segment complexities of randomness notionsHölzl, R.; Kräling, T.; Stephan, F. ; Wu, G.
2007Input-dependence in function-learningJain, S. ; Martin, E.; Stephan, F. 
2009Input-dependence in function-learningJain, S. ; Martin, E.; Stephan, F. 
2006Invertible classesJain, S. ; Nessel, J.; Stephan, F. 
2007Invertible classesJain, S. ; Nessel, J.; Stephan, F. 
2010Iterative learning of simple external contextual languagesBecerra-Bonache, L.; Case, J.; Jain, S. ; Stephan, F. 
2006Kolmogorov complexity and the recursion theoremKjos-Hanssen, B.; Merkle, W.; Stephan, P. 
Oct-2011Kolmogorov complexity and the recursion theoremKjos-Hanssen, B.; Merkle, W.; Stephan, F. 
2005Kolmogorov-Loveland randomness and stochasticityMerkle, W.; Miller, J.; Nies, A.; Reimann, J.; Stephan, F. 
Mar-2006Kolmogorov-Loveland randomness and stochasticityMerkle, W.; Miller, J.S.; Nies, A.; Reimann, J.; Stephan, F.