{"id":"W2116825378","doi":"10.1109/phycmp.1994.363677","title":"The complexity and entropy of Turing machines","year":2002,"lang":"en","type":"article","venue":"","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Turing machine; Universal Turing machine; Time hierarchy theorem; Computer science; Theoretical computer science; Entropy (arrow of time); Turing; Automaton; Cellular automaton; Dynamical systems theory; Symbolic dynamics; Computation; Algorithm; Mathematics; Pure mathematics; Programming language","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.00003765257,0.00002390229,0.00002968228,0.000006996248,0.00009922323,0.00003976665,0.0002126757,0.000005208843,0.00002102842],"category_scores_gemma":[0.000003148314,0.00001416871,0.00001107371,0.00005551081,0.00006161917,0.0000471731,0.00006875358,0.00001783668,0.000009978839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000143964,"about_ca_system_score_gemma":9.212752e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002170543,"about_ca_topic_score_gemma":0.000008776937,"domain_scores_codex":[0.9997729,0.000007300165,0.00005625114,0.00006508597,0.00004738652,0.00005104016],"domain_scores_gemma":[0.9997227,0.00003623334,0.00001712006,0.0002000263,0.000008340237,0.00001560184],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[8.557575e-8,0.00001108739,0.0003219313,0.000001801368,0.000001977534,1.407498e-7,0.00008852086,0.000001045707,0.002937096,0.9649231,0.0006095222,0.0311037],"study_design_scores_gemma":[0.0001180042,0.00001102573,0.01806093,0.000002237024,0.00000196222,0.00001119226,0.0000101135,0.9029563,0.01008431,0.04771005,0.02096976,0.00006413016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1528205,0.00114316,0.8057545,0.01245058,0.00009598602,0.0001873434,0.000001987116,0.0002078138,0.02733814],"genre_scores_gemma":[0.9846426,0.00003285737,0.01474135,0.00003696092,0.00000810246,0.000002121331,1.505473e-7,8.708628e-7,0.0005350445],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.917213,"threshold_uncertainty_score":0.07631548,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03382134274789048,"score_gpt":0.2311019121613642,"score_spread":0.1972805694134737,"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."}}