{"id":"W4360604354","doi":"10.1016/j.ic.2023.105027","title":"New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines","year":2023,"lang":"en","type":"article","venue":"Information and Computation","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decidability; Computer science; Turing machine; Pushdown automaton; Bounded function; Deterministic pushdown automaton; Deterministic context-free grammar; Model checking; Embedded pushdown automaton; Class (philosophy); Reachability problem; Automaton; Discrete mathematics; Theoretical computer science; Mathematics; Algorithm; Rule-based machine translation; Automata theory; Context-free grammar; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.0001509767,0.0000726027,0.00008665318,0.0002063363,0.0001097863,0.0001605974,0.0001005429,0.00002010257,0.00001988072],"category_scores_gemma":[0.000004640789,0.00007199845,0.00001630327,0.0002546588,0.00001461215,0.001717416,0.0001233826,0.00003007799,0.0000328087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000823225,"about_ca_system_score_gemma":0.00002150862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006175382,"about_ca_topic_score_gemma":0.000002106256,"domain_scores_codex":[0.9993927,0.00001595282,0.0002823632,0.00008355391,0.0001336014,0.00009179157],"domain_scores_gemma":[0.9996668,0.00003386326,0.0001401505,0.00008083772,0.00003309917,0.00004525497],"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.00001411177,0.00001988098,0.001885765,0.0001217803,0.00004001441,0.000001012962,0.006553321,0.001058283,0.005159075,0.009351014,0.002672602,0.9731231],"study_design_scores_gemma":[0.0006595078,0.0000548002,0.07283609,0.00003605875,0.000007652431,0.000007144597,0.0001779264,0.917722,0.001560759,0.005733191,0.00107392,0.0001309439],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5418651,0.00001059923,0.4572451,0.0004007596,0.0001099988,0.00011448,0.000006920859,0.0001148295,0.0001321549],"genre_scores_gemma":[0.9770028,0.00005306707,0.02205403,0.0003853371,0.00003741658,0.000006240474,0.0004128948,0.000004006262,0.00004422391],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9729922,"threshold_uncertainty_score":0.2936012,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007063848050454864,"score_gpt":0.230268096332771,"score_spread":0.2232042482823161,"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."}}