{"id":"W1986652500","doi":"10.1016/j.tcs.2004.01.002","title":"Representing recursively enumerable languages by iterated deletion","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Recursively enumerable language; Iterated function; Decidability; Closure (psychology); Recursively enumerable set; Characterization (materials science); Mathematics; Maximal set; Discrete mathematics; Combinatorics; Algorithm; Computer science; Programming language; Set (abstract data type); Physics","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.0013057,0.0001803166,0.0001727217,0.0001401792,0.0004811829,0.0007257253,0.002108111,0.00005563862,0.00003496659],"category_scores_gemma":[0.0001210753,0.0001524687,0.00005686362,0.001178224,0.001125539,0.001082464,0.0007463492,0.000199529,0.0001251567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008219075,"about_ca_system_score_gemma":0.00008968941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001966228,"about_ca_topic_score_gemma":2.360479e-7,"domain_scores_codex":[0.9976304,0.00009683018,0.0002572385,0.0007953004,0.0005898597,0.0006303245],"domain_scores_gemma":[0.9986227,0.0001402795,0.00008388536,0.0007758854,0.0001585484,0.0002186939],"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.000003311465,0.00005426987,0.00001949066,0.000003734242,0.000003017238,0.00002124058,0.0004764296,0.0002107467,0.01569765,0.9596516,0.0001827513,0.0236757],"study_design_scores_gemma":[0.0007520005,0.0002651132,0.0004801957,0.0001304279,0.000006948572,0.0001636876,0.00004326766,0.2586671,0.1837057,0.5546453,0.0005353739,0.0006049569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1324933,0.0001075858,0.8620281,0.001624549,0.0003084076,0.0001108031,0.000002009935,0.0003848386,0.00294042],"genre_scores_gemma":[0.8955535,0.000006062137,0.1033981,0.0009138325,0.00008759813,0.00000524995,0.000002878466,0.00000828327,0.0000244865],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7630602,"threshold_uncertainty_score":0.6998186,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004844094767187674,"score_gpt":0.2394791191391893,"score_spread":0.2346350243720016,"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."}}