{"id":"W1513208069","doi":"","title":"On the ratio between the maximal T-complexity and the T-complexity of random strings","year":2012,"lang":"en","type":"article","venue":"ResearchSpace (University of Auckland)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Code word; Limit (mathematics); Mathematics; Combinatorics; String (physics); Discrete mathematics; Computational complexity theory; Algorithm; Decoding methods; 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.00232507,0.0001039712,0.0002375284,0.00006808843,0.0007522492,0.00005976075,0.001533911,0.00004362954,0.00005882242],"category_scores_gemma":[0.0001431394,0.00005293835,0.00009277493,0.0003195555,0.002180401,0.0004327522,0.001213682,0.0003253067,0.00001083926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002130661,"about_ca_system_score_gemma":0.00005160353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001534036,"about_ca_topic_score_gemma":0.00006294942,"domain_scores_codex":[0.9982028,0.0005802857,0.0001022755,0.0001889509,0.0006144603,0.000311214],"domain_scores_gemma":[0.9973969,0.00150615,0.0001426873,0.0007486183,0.0001029347,0.0001027054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0008039362,0.0001013133,0.005907387,0.00003914607,0.0001218948,0.0000028546,0.007321138,0.00001452053,0.0001477556,0.9675229,0.01020424,0.007812974],"study_design_scores_gemma":[0.01521895,0.0005761207,0.7114081,0.0002041307,0.0001122747,0.0000204389,0.006999851,0.08542903,0.001638713,0.1602258,0.01758791,0.0005787159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6534624,0.0004436771,0.2816267,0.05954744,0.0001008392,0.0009775589,0.00009370109,0.00005135011,0.003696392],"genre_scores_gemma":[0.9975147,0.00008539917,0.002070819,0.00003634569,0.00004676243,5.276479e-7,0.000004185551,0.000003553582,0.0002377037],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8072971,"threshold_uncertainty_score":0.8033779,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07485299543413734,"score_gpt":0.2641319730999454,"score_spread":0.1892789776658081,"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."}}