{"id":"W2142521183","doi":"10.1007/978-0-387-49820-1_3","title":"Algorithmic Prefix Complexity","year":2008,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Prefix; Kolmogorov complexity; Computer science; Theoretical computer science; Algorithmic complexity; Development (topology); Mathematics; Mathematical economics; Algorithm; Philosophy; Linguistics","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":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00177052,0.001062773,0.001199604,0.001467436,0.0006243341,0.0007184834,0.01069536,0.0004360086,0.000102469],"category_scores_gemma":[0.00005385381,0.001074785,0.0003320191,0.00115263,0.003434109,0.001466555,0.007195313,0.001401098,0.0006480215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001041466,"about_ca_system_score_gemma":0.001426537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007353053,"about_ca_topic_score_gemma":0.00005574264,"domain_scores_codex":[0.9910849,0.000100098,0.001267975,0.003555553,0.002489755,0.001501758],"domain_scores_gemma":[0.9939468,0.0003802357,0.000546655,0.004036432,0.0005526649,0.0005372281],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006301085,0.0002454821,0.00006325681,0.00007013106,0.00002491935,0.0007708041,0.00124344,0.001865199,0.00001540783,0.1836128,0.00355298,0.8085293],"study_design_scores_gemma":[0.000719398,0.0003984995,0.002618707,0.0003033108,0.000009306546,0.0007888834,8.809038e-7,0.7510956,0.00008131577,0.1980767,0.04393662,0.001970754],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002085096,0.0007070806,0.9099904,0.0006249901,0.004266685,0.00107954,0.00002016237,0.0009436486,0.08215903],"genre_scores_gemma":[0.01037056,0.000257589,0.9658623,0.001224037,0.001328845,0.00003929665,0.00001295966,0.0001056836,0.02079872],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8065585,"threshold_uncertainty_score":0.9992779,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05284196442509746,"score_gpt":0.2678541476532553,"score_spread":0.2150121832281578,"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."}}