{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001931267,0.0001194315,0.0001859685,0.000128117,0.0001830687,0.0001753715,0.00160374,0.00003438389,0.0000198002],"category_scores_gemma":[0.0003638871,0.00009636536,0.00004562811,0.0008301894,0.001144214,0.000399376,0.0006929674,0.0002685928,0.00006326326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002559339,"about_ca_system_score_gemma":0.0001584407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001821622,"about_ca_topic_score_gemma":8.93633e-8,"domain_scores_codex":[0.9980885,0.0001865284,0.0002057021,0.0004390303,0.0006719774,0.0004081976],"domain_scores_gemma":[0.998805,0.0001563748,0.00008838216,0.0004333297,0.0002274911,0.0002894255],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004855084,0.00003253199,0.0002956201,0.000003699522,0.000002422348,0.00001008662,0.001236219,0.002129586,0.0002590253,0.9317538,0.00005736056,0.06421483],"study_design_scores_gemma":[0.0002711779,0.0004494938,0.0003430988,0.00002563655,0.000003083851,0.00003339165,0.00003937503,0.9571791,0.008872623,0.03168264,0.0009229896,0.0001774079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03396777,0.0000553725,0.9559437,0.0007044752,0.0004089896,0.00005556522,3.314845e-7,0.0001720714,0.008691735],"genre_scores_gemma":[0.8480878,0.000001416829,0.151614,0.0001093251,0.0001280967,0.00000160878,3.792166e-7,0.000004484142,0.00005295533],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9550495,"threshold_uncertainty_score":0.4215903,"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."}}