Order:
Disambiguations
Arun Sharma [3]Arun Kumar Sharma [1]
  1.  4
    Characterizing Language Identification in Terms of Computable Numberings.Sanjay Jain & Arun Sharma - 1997 - Annals of Pure and Applied Logic 84 (1):51-72.
    Identification of programs for computable functions from their graphs and identification of grammars for recursively enumerable languages from positive data are two extensively studied problems in the recursion theoretic framework of inductive inference.In the context of function identification, Freivalds et al. have shown that only those collections of functions, , are identifiable in the limit for which there exists a 1-1 computable numbering ψ and a discrimination function d such that1. for each , the number of indices i such that (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  2.  8
    The Structure of Intrinsic Complexity of Learning.Sanjay Jain & Arun Sharma - 1997 - Journal of Symbolic Logic 62 (4):1187-1201.
    Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (from a graph of the function) have served as models for investigating the boundaries of learnability. Recently, a new approach to the study of "intrinsic" complexity of identification in the limit has been proposed. This approach, instead of dealing with the resource requirements of the learning algorithm, uses the notion of reducibility from recursion theory to compare (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  3. Intra- and Inter-Household Differences in Antenatal Care, Delivery Practices and Postnatal Care Between Last Neonatal Deaths and Last Surviving Children in a Peri-Urban Area of India.Rohini Ghosh & Arun Kumar Sharma - 2010 - Journal of Biosocial Science 42 (4):511-530.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  4. The Structure of Intrinsic Complexity of Learning.Sanjay Jain & Arun Sharma - 1997 - Journal of Symbolic Logic 62 (4):1187-1201.
    Limiting identification of r.e. indexes for r.e. languages and limiting identification of programs for computable functions have served as models for investigating the boundaries of learnability. Recently, a new approach to the study of "intrinsic" complexity of identification in the limit has been proposed. This approach, instead of dealing with the resource requirements of the learning algorithm, uses the notion of reducibility from recursion theory to compare and to capture the intuitive difficulty of learning various classes of concepts. Freivalds, Kinber, (...)
    Direct download  
     
    Export citation  
     
    My bibliography