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 76 to 95 of 106 < previous   next >
Issue DateTitleAuthor(s)
2013Partial learning of recursively enumerable languagesGao, Z.; Stephan, F. ; Zilles, S.
Dec-2007Posts programme for the Ershov hierarchyAfshari, B.; Barmpalias, G.; Cooper, S.B.; Stephan, F. 
17-Oct-2008PrefaceLong, P.M.; Stephan, F. 
2008Prescribed learning of indexed familiesJain, S. ; Stephan, F. ; Nan, Y. 
2009Prescribed learning of r.e. classesJain, S. ; Stephan, F. ; Ye, N. 
2005Presentations of K-trivial reals and kolmogorov complexityStephan, F. ; Wu, G.
Dec-2006Randomness and universal machinesFigueira, S.; Stephan, F. ; Wu, G.
2005Randomness, relativization and turing degreesNies, A.; Stephan, F. ; Terwijn, S.A.
2010Regular patterns, regular languages and context-free languagesJain, S. ; Ong, Y.S.; Stephan, F. 
Aug-2011Relativizations of randomness and genericity notionsFranklin, J.N.Y.; Stephan, F. ; Yu, L.
Jul-2011Representation of left-computable ε-random realsCalude, C.S.; Hay, N.J.; Stephan, F. 
2007Results on memory-limited U-shaped learningCarlucci, L.; Case, J.; Jain, S. ; Stephan, F. 
2011Robust learning of automatic classes of languagesJain, S. ; Martin, E.; Stephan, F. 
Jun-2010Schnorr trivial sets and truth-table reducibilityFranklin, J.N.Y.; Stephan, F. 
2013Selection by recursively enumerable setsMerkle, W.; Stephan, F. ; Teutsch, J.; Wang, W.; Yang, Y. 
2006Some recent results in U-shaped learningJain, S. ; Stephan, F. 
2010Splitting of learnable classesLi, H.; Stephan, F. 
2005The dot-depth and the polynomial hierarchies correspond on the delta levelsBorchert, B.; Lange, K.-J.; Stephan, F. ; Tesson, P.; Thérien, D.
2004The dot-depth and the polynomial hierarchy correspond on the delta levelsBorchert, B.; Lange, K.-J.; Stephan, F. ; Tesson, P.; Thérien, D.
Apr-2010Topological aspects of poset spacesMummert, C.; Stephan, F.