Computability theory examines the limitations of various theoretical models of the computer, including the most powerful known model - the Turing machine.

可计算性理论探讨了计算机的各种理论模型的局限性，包括已知的最强大的模式，-图灵机。

youdao

The most famous finite state machine is probably Alan Turing's hypothetical device: the Turing machine, which he wrote about in his 1936 paper, "On Computable Numbers."

最著名的有限状态机可能是阿兰·图灵在1936年发表的论文《On Computable Numbers》上写下的的猜想——图灵机。

youdao

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.

通常认为他是现代计算机科学之父，图灵利用图灵机的发明提供了一套影响深远的关于算法和计算概念的规范。

youdao

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

Turing is celebrated for his work in deciphering messages encrypted by the German Enigma machine.

BBC: Suffolk