{"id":"W2229623334","doi":"10.1016/j.ic.2015.12.013","title":"Bounded Combinatory Logic and lower complexity","year":2016,"lang":"en","type":"article","venue":"Information and Computation","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Northwestern Polytechnic","funders":"","keywords":"Bounded function; Class (philosophy); Mathematics; Distributivity; Discrete mathematics; Linear logic; Combinatory logic; Characterization (materials science); Complexity class; Polynomial; Computer science; Time complexity; Pure mathematics; Artificial intelligence; Distributive property","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001980341,0.00007287147,0.00008186913,0.00007040203,0.0001301683,0.000248113,0.00009501638,0.00004085828,0.000004285727],"category_scores_gemma":[0.0000158556,0.00004926434,0.00001492871,0.00008481609,0.00007701126,0.001461141,0.00007178266,0.00003116155,0.00006567287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002027322,"about_ca_system_score_gemma":0.00001937531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001617733,"about_ca_topic_score_gemma":0.000003060225,"domain_scores_codex":[0.9994364,0.00003437954,0.0001959238,0.00009540703,0.0001314603,0.0001064341],"domain_scores_gemma":[0.9996088,0.0000423029,0.0001116823,0.00009120031,0.00008884585,0.00005717601],"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.000002808222,0.00000979176,0.0003434236,0.00001472761,0.000003508922,4.518447e-7,0.0005747731,0.00000254026,0.000008190611,0.8018911,0.0001921337,0.1969565],"study_design_scores_gemma":[0.001767564,0.0002728202,0.03388555,0.00001253884,0.000004712545,0.00006306538,0.0001467224,0.05603376,0.0000739054,0.8753798,0.03206558,0.0002939728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02834777,0.00003926806,0.9666452,0.0007421272,0.0002945493,0.0001388684,5.380327e-7,0.0001478267,0.003643866],"genre_scores_gemma":[0.9969321,0.00001147765,0.002520299,0.0004744937,0.00001269476,0.000005637643,0.000004462394,0.000001469356,0.00003730373],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9685844,"threshold_uncertainty_score":0.239256,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03073119147230182,"score_gpt":0.2548828748145271,"score_spread":0.2241516833422253,"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."}}