{"id":"W2166403219","doi":"10.1002/malq.200310061","title":"On existence of complete sets for bounded reducibilities","year":2003,"lang":"en","type":"article","venue":"Mathematical logic quarterly","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Recursively enumerable language; Oracle; Mathematics; Hierarchy; Set (abstract data type); Bounded function; Combinatorics; Discrete mathematics; Computer science","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.001144301,0.0002641701,0.0005561361,0.00009143884,0.0001224659,0.0001281546,0.0009387247,0.00009866047,0.00009643911],"category_scores_gemma":[0.0007101974,0.0002092788,0.0002245112,0.0002569718,0.0002909181,0.0001752596,0.00005358829,0.0001358688,0.00009717073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006803092,"about_ca_system_score_gemma":0.00007172885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003219712,"about_ca_topic_score_gemma":0.000001530985,"domain_scores_codex":[0.9974492,0.0002196788,0.0006906147,0.0007034935,0.000450271,0.0004867702],"domain_scores_gemma":[0.9960225,0.002129165,0.0001800828,0.001341395,0.0001879786,0.0001389292],"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.000008881711,0.0003981317,0.000003577771,0.0001866962,0.00001251097,0.000003307271,0.001642758,0.0000119637,0.0001452999,0.9931144,0.000156744,0.00431571],"study_design_scores_gemma":[0.0003998046,0.002058636,0.0000646843,0.00004749935,0.000008118805,0.00003389421,0.0002282476,0.03280985,0.0003461594,0.9635549,0.0002181926,0.0002299645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04885214,0.00003373249,0.9368914,0.0005767881,0.0002948846,0.0007995752,0.00001666547,0.0001959631,0.01233879],"genre_scores_gemma":[0.5916137,2.523948e-7,0.4079297,0.0001884767,0.00001761229,0.00007752651,0.000001838405,0.00001099897,0.0001598815],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5427616,"threshold_uncertainty_score":0.8534142,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06315396646092529,"score_gpt":0.2998707246096498,"score_spread":0.2367167581487245,"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."}}