{"id":"W2120230527","doi":"10.2178/jsl/1208359065","title":"Generic complexity of undecidable problems","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Undecidable problem; Construct (python library); Decidability; Word problem (mathematics education); Mathematics; Halting problem; Discrete mathematics; Computational complexity theory; Computer science; Algorithm; Turing machine; Arithmetic; Programming language","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":[],"consensus_categories":[],"category_scores_codex":[0.0004690677,0.0000999176,0.0003345071,0.0001406792,0.0000796442,0.00002258908,0.0009091055,0.00004648325,0.00004228538],"category_scores_gemma":[0.00003379359,0.00007061166,0.0001382131,0.0003776617,0.0001744096,0.0003375433,0.0001300749,0.0001448781,0.00001491281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003566014,"about_ca_system_score_gemma":0.0001208508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000154919,"about_ca_topic_score_gemma":9.076315e-7,"domain_scores_codex":[0.9987769,0.00007231987,0.0004944059,0.0001160826,0.000343445,0.000196864],"domain_scores_gemma":[0.9988649,0.00006349067,0.0005159689,0.0002905584,0.0001713193,0.00009376594],"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.00004591457,0.001443422,0.01034468,0.0001762381,0.0002531185,0.0006075805,0.005187537,0.004631308,0.06688675,0.8797612,0.01338296,0.01727933],"study_design_scores_gemma":[0.002074842,0.001347087,0.1033866,0.0001885537,0.00003606819,0.007488539,0.0001681186,0.018758,0.01645107,0.8441821,0.005385057,0.0005339506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8038255,0.001605631,0.1882024,0.0009461512,0.0005161809,0.000105872,0.000001628293,0.00004757226,0.004749129],"genre_scores_gemma":[0.9701329,0.0001793281,0.02915064,0.0003094271,0.0001136435,8.239768e-7,2.111807e-7,0.00000512532,0.0001079352],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1663074,"threshold_uncertainty_score":0.287946,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0957049011215074,"score_gpt":0.2547248305775202,"score_spread":0.1590199294560128,"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."}}