{"id":"W2096578724","doi":"10.1016/j.tcs.2014.09.022","title":"Confident and consistent partial learning of recursive functions","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National University of Singapore","keywords":"Recursive functions; Partial function; Computer science; Mathematics; Calculus (dental); Algebra over a field; Theoretical computer science; Algorithm; Artificial intelligence; Discrete mathematics; Pure mathematics; Medicine","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.001440412,0.0001095745,0.0001797668,0.0001108184,0.0003509919,0.0001819327,0.0006744471,0.00002920057,0.00002047278],"category_scores_gemma":[0.0002644164,0.00008905614,0.00004102257,0.0004144115,0.002167797,0.0001991919,0.0005786516,0.0002234127,0.00002144765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001244734,"about_ca_system_score_gemma":0.00004905195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007954593,"about_ca_topic_score_gemma":1.580232e-7,"domain_scores_codex":[0.998414,0.0002065028,0.0002114879,0.0004574651,0.0004091679,0.0003013159],"domain_scores_gemma":[0.998831,0.0003701833,0.00008812176,0.0003564318,0.0001578311,0.0001963885],"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.000002689836,0.0000191752,0.0002902395,0.000004811655,0.000002734155,0.00000109532,0.0003570011,0.0006108583,0.0002092415,0.9323129,0.00001225227,0.06617699],"study_design_scores_gemma":[0.0002093708,0.0004630131,0.001758856,0.00002787414,0.000005766868,0.00003822975,0.00001546039,0.9610066,0.00141961,0.03409749,0.000823311,0.0001344534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04617081,0.00001878674,0.9496218,0.0008919524,0.000430278,0.00006028273,2.908363e-7,0.00009348131,0.002712333],"genre_scores_gemma":[0.9431192,0.00000253463,0.0565998,0.0001554521,0.00008894064,0.000002223471,3.263647e-7,0.000003385845,0.00002815813],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9603957,"threshold_uncertainty_score":0.7987338,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005754438812722299,"score_gpt":0.2314252464419749,"score_spread":0.2256708076292526,"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."}}