{"id":"W1571887931","doi":"10.1007/978-3-642-30870-3_12","title":"An Undecidable Nested Recurrence Relation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Undecidable problem; Mathematics; Combinatorics; Relation (database); Recurrence relation; Turing; Left and right; Discrete mathematics; Computer science; Decidability","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.0009189493,0.0005968408,0.0006391015,0.0005161249,0.001516126,0.002043526,0.001363818,0.00109124,0.006577587],"category_scores_gemma":[0.004977563,0.0007387397,0.001153438,0.0006706515,0.002242083,0.005337526,0.001639368,0.003103635,0.001240094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001358691,"about_ca_system_score_gemma":0.001188693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002534075,"about_ca_topic_score_gemma":0.003603456,"domain_scores_codex":[0.998857,0.0002237774,0.00009073712,0.0003096648,0.0003545807,0.0001642561],"domain_scores_gemma":[0.9961603,0.002725789,0.0001969936,0.0004361218,0.000384816,0.00009592209],"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.00006026528,0.00005195067,0.0002156763,0.0001505761,0.00001109869,0.0002409021,0.000527182,0.004027218,0.00451255,0.9623094,0.003556791,0.02433642],"study_design_scores_gemma":[0.00003267127,0.00001874351,0.0001199521,0.00002773325,0.00002634395,0.0001853791,0.00009230639,0.0162211,0.003504513,0.9682165,0.01153664,0.0000180741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.242518,0.001779049,0.6091771,0.002801698,0.0005915122,0.000270872,0.001111014,0.003340878,0.1384098],"genre_scores_gemma":[0.793287,0.0008288986,0.1553196,0.0006440114,0.0002855134,0.0002301333,0.001235842,0.0006506233,0.04751839],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006577587,"threshold_uncertainty_score":0.02200419,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01961635530253146,"score_gpt":0.2509982774693665,"score_spread":0.231381922166835,"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."}}