{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003111331,0.0003547311,0.0009630861,0.002759699,0.00168875,0.003934551,0.001091391,0.001319989,0.004754216],"category_scores_gemma":[0.02180899,0.0006981878,0.001060828,0.001362977,0.00439534,0.006742527,0.00295151,0.002490527,0.0002673765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001704804,"about_ca_system_score_gemma":0.0006380876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008366729,"about_ca_topic_score_gemma":0.0007507477,"domain_scores_codex":[0.9970415,0.0005599686,0.0001950523,0.0005735164,0.001090304,0.0005396903],"domain_scores_gemma":[0.972936,0.02127243,0.001376964,0.001706911,0.001608488,0.001099157],"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.00008235635,0.00003997664,0.001474201,0.00009155572,0.00001742022,0.0001311061,0.0005901325,0.00362611,0.001190513,0.9837843,0.0006088433,0.008363465],"study_design_scores_gemma":[0.00003474861,0.00005875048,0.001401377,0.00005694183,0.00002231899,0.0003657848,0.0003442273,0.01657767,0.003462666,0.9743148,0.003322139,0.00003860295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7841934,0.001548077,0.1571249,0.001471055,0.00005186811,0.0001515521,0.001143257,0.0004721585,0.05384367],"genre_scores_gemma":[0.9769498,0.0002787623,0.01983989,0.0001303837,0.00006346785,0.00008393688,0.0004696094,0.00004539054,0.002138657],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004754216,"threshold_uncertainty_score":0.01645452,"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."}}