{"id":"W2407565584","doi":"","title":"Computationally Limited Randomness.","year":2011,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Randomness; Bounded function; Turing machine; Discrete mathematics; Logarithm; Randomized algorithm; Computer science; Mathematics; Connection (principal bundle); Algorithm; Statistics; Mathematical analysis","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.0001315184,0.0000679674,0.00008303963,0.00008115505,0.00008379576,0.00004851834,0.0005894024,0.00002185407,0.0002104519],"category_scores_gemma":[0.00001240055,0.00005789371,0.0000534187,0.0003076101,0.00003997373,0.0002637161,0.0001479021,0.00005415078,0.0001372901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004889696,"about_ca_system_score_gemma":0.00002280147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002607743,"about_ca_topic_score_gemma":0.000005136494,"domain_scores_codex":[0.9993808,0.00002920327,0.0001244476,0.0001841044,0.0001485843,0.0001328646],"domain_scores_gemma":[0.9995283,0.00007361664,0.00002846457,0.0002448575,0.0000697698,0.00005498863],"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.000006562165,0.00007145859,0.0002146178,0.000002039048,0.00001171232,0.000009477633,0.0006091072,0.00001159103,0.00001867392,0.9615529,0.0008801264,0.03661172],"study_design_scores_gemma":[0.002206981,0.0001260663,0.05764849,0.00001213925,0.000006003195,0.00005674922,0.00004222386,0.2907493,0.001686373,0.6400908,0.006955276,0.0004196038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002474883,0.000022738,0.9200556,0.0002066028,0.0002200341,0.00006043248,4.268409e-7,0.0002759538,0.07668331],"genre_scores_gemma":[0.4989006,0.000002814323,0.4999495,0.0007274012,0.00002696965,0.000005618339,0.000001543643,0.000003086201,0.0003824845],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4964257,"threshold_uncertainty_score":0.2360837,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06157817614534837,"score_gpt":0.2253004410436388,"score_spread":0.1637222648982904,"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."}}