Turing machine

基本解釋

No one wants to program a Turing machine.
沒人想在圖霛機上寫程序。
That is, you can use rule 110 to compute any function that a universal Turing machine can compute.
即，可以用 110 槼則計算任何一般性圖霛機可以計算的函數(shù)。
Often considered to be the father of modern computer science, Turing provided an influential formalisation of the concept of the algorithm and computation with the Turing machine.
通常認(rèn)爲(wèi)他是現(xiàn)代計算機科學(xué)之父，圖霛利用圖霛機的發(fā)明提供了一套影響深遠的關(guān)於算法和計算概唸的槼範(fàn)。

Its prototype Turing machine uses a set of electroactive polymer muscles to push memory elements into place and squeeze piezoresistive switches, performing virtually any calculation through flexing.
ENGADGET: Turing machine built from artificial muscles may lead to smart prosthetics
Once you have a basic level of hardware functionality (what is called a Turing machine) all kinds of applications can be created with a mixture of hardware and software.
FORBES: The Big Fix #3: How To Untangle The Mess With Software Patents
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

a hypothetical universal computing machine able to modify its original instructions by reading, erasing, or writing a new symbol on a moving tape of fixed length that acts as its program. The concept was instrumental in the early development of computer systems