{"id":"W2060880530","doi":"10.1017/s0960129512000096","title":"The monoidal structure of Turing machines","year":2013,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Turing machine; Turing machine examples; Super-recursive algorithm; Universal Turing machine; Description number; NSPACE; Time hierarchy theorem; Computer science; Non-deterministic Turing machine; Probabilistic Turing machine; Von Neumann architecture; Theoretical computer science; Algebra over a field; Mathematics; Algorithm; Pure mathematics; Programming language; Computation","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.0004057176,0.0002192,0.0002573543,0.0001683733,0.000396936,0.0006261027,0.003466566,0.00004657858,0.0000189976],"category_scores_gemma":[0.0001208887,0.000123083,0.00006985528,0.0009666963,0.0007063879,0.0004029387,0.001328698,0.0003115397,0.000007149868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003388222,"about_ca_system_score_gemma":0.00007620271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003268393,"about_ca_topic_score_gemma":0.000004517102,"domain_scores_codex":[0.9976498,0.00006557832,0.0004792983,0.0005247457,0.0007041133,0.0005764742],"domain_scores_gemma":[0.9982152,0.0004616315,0.0001512104,0.0009183826,0.000122161,0.0001314272],"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.000002061819,0.0000349108,0.0006762359,0.00005283625,0.000007568266,0.00000747031,0.001359499,0.02409243,0.004977403,0.2328989,0.0001033378,0.7357874],"study_design_scores_gemma":[0.00007833718,0.00002022029,0.009691469,0.00002104229,6.555559e-7,0.00004474204,0.000003042957,0.6118925,0.00213225,0.3759976,0.00001664258,0.0001014767],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4436108,0.00007564276,0.5548607,0.0005981376,0.0005085487,0.0001984945,8.177806e-7,0.00006463468,0.00008219433],"genre_scores_gemma":[0.7278606,0.000001161898,0.2719406,0.00009508685,0.00008977994,0.000003033563,1.168226e-7,0.000005610895,0.000003986008],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7356859,"threshold_uncertainty_score":0.6441801,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006107569646732289,"score_gpt":0.2314636695249382,"score_spread":0.225356099878206,"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."}}