{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003597327,0.001639111,0.002320895,0.002994347,0.002717853,0.009238876,0.005805511,0.003579797,0.01303922],"category_scores_gemma":[0.01790175,0.001500476,0.004035706,0.004961993,0.007245624,0.02222199,0.005904989,0.009846782,0.001074942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005908335,"about_ca_system_score_gemma":0.00194113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00173743,"about_ca_topic_score_gemma":0.001780164,"domain_scores_codex":[0.9935091,0.001434804,0.0004292053,0.001421175,0.002314292,0.0008913306],"domain_scores_gemma":[0.9827339,0.01261198,0.0007777171,0.002546285,0.0007158638,0.0006141154],"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.00007889196,0.00005439821,0.0004448671,0.0002042346,0.00003983378,0.00006401753,0.0002159854,0.00958958,0.0003848194,0.9734596,0.003088072,0.0123756],"study_design_scores_gemma":[0.00002266326,0.000005723954,0.000147846,0.00001675002,0.00001603054,0.00005362523,0.00003035468,0.009442287,0.0002332419,0.9882682,0.001756279,0.000007032436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2222636,0.005670351,0.5522642,0.01547037,0.0004863506,0.0004330715,0.003726511,0.001712684,0.1979728],"genre_scores_gemma":[0.8795332,0.003546502,0.08694018,0.001499118,0.001159435,0.0006619348,0.005827269,0.0006275177,0.02020488],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01303922,"threshold_uncertainty_score":0.04362059,"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."}}