{"id":"W2027737305","doi":"10.1016/j.apal.2010.07.004","title":"A measure-theoretic proof of Turing incomparability","year":2010,"lang":"en","type":"article","venue":"Annals of Pure and Applied Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lemma (botany); Turing; Mathematics; Existential quantification; Description number; Discrete mathematics; Turing machine; Combinatorics; NSPACE; Set (abstract data type); Measure (data warehouse); Computer science; Universal Turing machine; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.001213514,0.0001869859,0.0004351489,0.00008672527,0.00006237739,0.00003685696,0.0007798163,0.0001207926,0.00001958566],"category_scores_gemma":[0.00009516915,0.0001482441,0.00009805701,0.0003197169,0.0003645839,0.0001144519,0.0004422488,0.0002813073,0.000002690172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003670849,"about_ca_system_score_gemma":0.00005082562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009991586,"about_ca_topic_score_gemma":0.00001779872,"domain_scores_codex":[0.998404,0.00006052278,0.0004298495,0.0004870273,0.0003305258,0.0002880645],"domain_scores_gemma":[0.9985188,0.0001965231,0.0002112698,0.0007599739,0.0002016175,0.0001118589],"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.00005292859,0.0007867811,0.003086519,0.0003670985,0.00004686465,0.000003645216,0.00126197,0.0002936005,0.03579343,0.8193616,0.0001510497,0.1387945],"study_design_scores_gemma":[0.0003136972,0.0002226509,0.01806349,0.0000189641,0.00001059719,0.00001320346,0.00003839179,0.003816914,0.157575,0.8194903,0.0001706171,0.0002662355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9229974,0.0002369881,0.06849564,0.00116032,0.0001590461,0.0004872477,0.000004052302,0.00008661061,0.006372763],"genre_scores_gemma":[0.9815841,0.000005632921,0.01816491,0.0001606325,0.00005437211,0.00001849959,8.677149e-7,0.000005760729,0.000005265195],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1385282,"threshold_uncertainty_score":0.6045218,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04048729888383151,"score_gpt":0.2811536320011267,"score_spread":0.2406663331172952,"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."}}