{"id":"W1981403153","doi":"10.1016/j.tcs.2008.02.021","title":"Learning recursive functions: A survey","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Learnability; Randomness; Algorithmic learning theory; Computer science; Set (abstract data type); Limit (mathematics); Focus (optics); Function (biology); Field (mathematics); Artificial intelligence; Mathematics; Theoretical computer science; Active learning (machine learning); Pure mathematics; Statistics","routes":{"ca_aff":true,"ca_fund":false,"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.003943026,0.001194569,0.002589744,0.002591961,0.0007620528,0.003102672,0.002397607,0.001956373,0.003591375],"category_scores_gemma":[0.01082448,0.00106708,0.001187915,0.00487794,0.001346626,0.007674208,0.002020736,0.002738283,0.002667983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009699871,"about_ca_system_score_gemma":0.001454508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00162375,"about_ca_topic_score_gemma":0.001487544,"domain_scores_codex":[0.9982235,0.0004424633,0.0001768447,0.0005541833,0.0004986437,0.0001044767],"domain_scores_gemma":[0.9920294,0.005960147,0.0001865425,0.0008623072,0.0008411069,0.0001205874],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005627548,0.0001428993,0.002973323,0.001556188,0.00007968483,0.00004174384,0.0001721068,0.007045439,0.0007151462,0.06641752,0.007431623,0.9133682],"study_design_scores_gemma":[0.00007920378,0.0005243714,0.00648793,0.001801126,0.0003357338,0.00173601,0.000462676,0.1543467,0.006825803,0.4323143,0.3949212,0.0001648426],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.008431903,0.4651053,0.5104135,0.002222457,0.0003831068,0.00007957675,0.0002079581,0.0006757956,0.01248043],"genre_scores_gemma":[0.1278394,0.5723639,0.284466,0.001470261,0.003546933,0.0002102692,0.00127153,0.0003873828,0.00844442],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.003943026,"threshold_uncertainty_score":0.02085298,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01448335140856298,"score_gpt":0.2498447219833575,"score_spread":0.2353613705747945,"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."}}