{"id":"W2209166757","doi":"10.1016/j.tcs.2015.10.035","title":"Partial learning of recursively enumerable languages","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; National University of Singapore","keywords":"Consistency (knowledge bases); Recursion (computer science); Mathematics; Inference; Recursively enumerable language; Limit (mathematics); Extension (predicate logic); Partial function; Class (philosophy); Relation (database); Inductive reasoning; Theoretical computer science; Computer science; Artificial intelligence; Discrete mathematics; Algorithm; Programming language; Data mining","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002066225,0.0006720556,0.0009182667,0.001103568,0.001068676,0.002984928,0.002119463,0.001215942,0.007331421],"category_scores_gemma":[0.02652023,0.0008651442,0.001398733,0.001266394,0.002459894,0.007610806,0.003275197,0.003311195,0.0009441817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001668372,"about_ca_system_score_gemma":0.001874981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00149584,"about_ca_topic_score_gemma":0.003806736,"domain_scores_codex":[0.997856,0.001010426,0.0001194129,0.0003971292,0.0003852435,0.0002317576],"domain_scores_gemma":[0.9735166,0.0216662,0.0007490434,0.002283779,0.001258953,0.0005254395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000245281,0.0001107032,0.002881057,0.0003247843,0.00006432978,0.0001455164,0.0006920346,0.05977356,0.002341978,0.8377291,0.00449431,0.09119722],"study_design_scores_gemma":[0.00001614725,0.00002624564,0.0001893276,0.000038064,0.00001477714,0.00005907727,0.00005161427,0.1419959,0.0009281651,0.855446,0.001222586,0.00001221563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1549252,0.0007685765,0.8290098,0.001461742,0.00008212109,0.00007221317,0.0007381952,0.001630218,0.01131176],"genre_scores_gemma":[0.7992671,0.0006443993,0.182791,0.0005729509,0.0001574941,0.0002382089,0.002399315,0.0005240883,0.01340548],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007331421,"threshold_uncertainty_score":0.02452606,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01160897500648919,"score_gpt":0.2756719027429692,"score_spread":0.26406292773648,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}