{"id":"W2784921327","doi":"10.1016/j.tcs.2019.07.003","title":"Type-two polynomial-time and restricted lookahead","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; CHIST-ERA; Agence Nationale de la Recherche","keywords":"Computability; Oracle; Class (philosophy); Time complexity; Mathematics; Closure (psychology); Polynomial; Discrete mathematics; Simple (philosophy); Subroutine; Computer science; Combinatorics; Programming language","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001235586,0.0002874168,0.0003701688,0.0002754314,0.0002915183,0.0007108999,0.002937699,0.00007623452,0.0001372484],"category_scores_gemma":[0.0001387243,0.000241534,0.00006281427,0.002047776,0.002346585,0.0008079994,0.002987152,0.0002962037,0.0009111642],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009834151,"about_ca_system_score_gemma":0.0002445588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001604676,"about_ca_topic_score_gemma":5.76241e-7,"domain_scores_codex":[0.9964364,0.0001920102,0.0003670792,0.001350811,0.0008259424,0.0008277721],"domain_scores_gemma":[0.9970931,0.0005785806,0.000084258,0.001509756,0.0002887756,0.0004455759],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002221142,0.0001148886,0.0006054151,0.00001092281,0.000007314935,0.00003162897,0.0002872642,0.0003439152,0.006234187,0.9184552,0.0001747896,0.0737123],"study_design_scores_gemma":[0.0005156338,0.0005366187,0.007151132,0.0000214085,0.000004755877,0.0001320154,0.000001965557,0.9349513,0.00158769,0.05445687,0.0002453807,0.0003952337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5177606,0.00006027992,0.4731846,0.001261305,0.001396281,0.0004257698,0.00000174764,0.0004824141,0.005426969],"genre_scores_gemma":[0.8341861,0.000003223307,0.165084,0.0004948131,0.0001537556,0.000002226244,7.844917e-7,0.00001071567,0.00006440948],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9346074,"threshold_uncertainty_score":0.9998667,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006589398957977416,"score_gpt":0.236649227521325,"score_spread":0.2300598285633476,"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."}}