{"id":"W1536365843","doi":"10.1007/978-3-540-74510-5_41","title":"Generic Complexity of Undecidable Problems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Undecidable problem; Decidability; Turing machine; Halting problem; Construct (python library); Word problem (mathematics education); Mathematics; Computational complexity theory; Discrete mathematics; Computer science; Theoretical computer science; Algorithm; 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":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.002378277,0.0007926307,0.001110545,0.001350361,0.0002582453,0.0003756134,0.006414457,0.0004814256,0.00006030201],"category_scores_gemma":[0.0001193649,0.0007399002,0.0002817558,0.001744985,0.002789948,0.0005926492,0.003657793,0.001044111,0.00004564282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006501957,"about_ca_system_score_gemma":0.0009333647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001390823,"about_ca_topic_score_gemma":0.0003673386,"domain_scores_codex":[0.993299,0.00006837767,0.001210407,0.002346638,0.001929292,0.001146254],"domain_scores_gemma":[0.9947972,0.0007515882,0.0006774277,0.002787672,0.0006803112,0.0003057678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007998453,0.0001810214,0.0002023113,0.0001966195,0.00002746914,0.0001054771,0.0006564633,0.1016841,0.0002776154,0.08922474,0.00002852436,0.8074077],"study_design_scores_gemma":[0.0002721046,0.0002906244,0.0005113076,0.0002147863,0.000007943717,0.00008423784,1.152298e-7,0.5063673,0.001410698,0.4889987,0.001117744,0.0007245224],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001429746,0.000703919,0.9869313,0.0003914186,0.002184929,0.0008078371,0.000009066766,0.0002586933,0.008569851],"genre_scores_gemma":[0.07036515,0.00003568586,0.9280221,0.0007505725,0.0004725218,0.000009718441,0.000006687234,0.00005033632,0.0002872233],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8066832,"threshold_uncertainty_score":0.9999239,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07644337339592297,"score_gpt":0.276475077577761,"score_spread":0.200031704181838,"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."}}