本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2023-11-28
摘要
Real-world computers have operational constraints that cause nonzero 熵 production (EP). In particular, almost all real-world computers are 'periodic', iteratively undergoing the same physical process; and 'local', in that subsystems evolve whilst physically decoupled from the rest of the computer. These constraints are so universal because decomposing a complex computation into small, iterative calculations is what makes computers so powerful. We first derive the nonzero EP caused by the locality and periodicity constraints for deterministic finite automata (DFA), a foundational system of computer science theory. We then relate this minimal EP to the 計算 characteristics of the DFA. We thus divide the 語言s recognised by DFA into two classes: those that can be recognised with zero EP, and thos
※ 此為已發表論文，全文需透過期刊付費取得