{"id":"W2951776502","doi":"10.48550/arxiv.1203.0586","title":"An Undecidable Nested Recurrence Relation","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Undecidable problem; Relation (database); Recurrence relation; Turing; Mathematics; Combinatorics; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002130578,0.0002045894,0.000176631,0.000153151,0.0001950043,0.0001522223,0.001732721,0.0002439948,0.00003156484],"category_scores_gemma":[0.00001043534,0.0002484267,0.00009702813,0.0006509008,0.00005604355,0.0008663242,0.0008201841,0.0003894328,0.0003142498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001467588,"about_ca_system_score_gemma":0.0001505238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001056449,"about_ca_topic_score_gemma":0.00002379175,"domain_scores_codex":[0.9985495,0.0001134467,0.0001569814,0.0008107337,0.00008063798,0.0002887468],"domain_scores_gemma":[0.9976596,0.000056323,0.0002051656,0.001768987,0.0001063141,0.0002036101],"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.000005453653,0.0003136672,0.003803744,0.00003798946,0.00002874763,0.00002960938,0.0003475552,0.06293101,0.0003693337,0.9283373,0.000269614,0.003526003],"study_design_scores_gemma":[0.0001991037,0.00002587113,0.01420534,0.00004440975,0.00005120381,0.000005369407,0.00002694107,0.9192739,0.0002362512,0.06278099,0.002682154,0.0004684712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1426427,0.0000608019,0.8519234,0.00006078625,0.0003661601,0.0002632551,0.00000853227,0.0004059177,0.004268426],"genre_scores_gemma":[0.994622,0.00005009097,0.00431079,0.00003062779,0.000069319,0.000002295385,0.00008183746,0.00001184015,0.0008211981],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8655563,"threshold_uncertainty_score":0.9999968,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08915350838469657,"score_gpt":0.2040125256352398,"score_spread":0.1148590172505432,"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."}}