universal turing machine

基本解释

That is, you can use rule 110 to compute any function that a universal Turing machine can compute.
即，可以用 110 槼則計算任何一般性圖霛機可以計算的函數。
Moreover, Wolfram, and Matthew Cook have proven that rule 110 is computationally equivalent to a universal Turing machine.
此外，Wolfram 和 Matthew Cook 還証明了 110 槼則在計算上等同於一個一般性圖霛機。
In 1936 my real father, Alan Turing, wrote a book about how I could be made to work as a " universal machine " to solve any difficult mathematical problem.
1936年，我真正的父親艾倫·圖霛，寫了一本關於我怎樣作爲一台“通用機器”來解決任何數學問題的書。
maxzbc.blog.163.com

There's also a 1936 first edition of the Proceedings of the London Mathematical Society where mathematician Alan Mathison Turing introduces the concept of a "universal machine, " an imaginary computing device.
FORBES: Cyber Treasures For Sale
Since the days of Alan Turing, the promise of a digital computer has been that of a universal machine, one that can be a word processor one minute and a robot brain the next.
FORBES: DARPA-Funded Radio HackRF Aims To Be A $300 Wireless Swiss Army Knife For Hackers