e/Post-Turing machine

Information
has gloss	eng: A Post–Turing machine is a "program formulation" of an especially simple type of Turing machine, comprising a variant of Emil Posts Turing-equivalent model of computation described below. (Posts model and Turings model, though very similar to one another, were developed independently. Turings paper was received for publication in May of 1936, followed by Post's in October.) A Post-Turing machine uses a binary alphabet, an infinite sequence of binary storage locations, and a primitive programming language with instructions for bi-directional movement among the storage locations and alteration of their contents one at a time. The names "Post-Turing program" and "Post-Turing machine" were used by Martin Davis in 1973-1974 (Davis 1973, p.69ff). Later in 1980, Davis used the name "Turing-Post program" (Davis, in Steen p. 241).
lexicalization	eng: Post-Turing Machine
lexicalization	eng: Post–Turing machine
instance of	e/Computational model

Meaning
Russian
has gloss	rus: Машина Поста (МП) — абстрактная вычислительная машина, предложенная Эмилем Леоном Постом (Emil L. Post), которая отличается от машины Тьюринга большей простотой. Обе машины «эквивалентны» и были созданы для уточнения понятия «алгоритм».
lexicalization	rus: Машина Поста
Chinese
has gloss	zho: Post-图灵机是一种特别简单类型的图灵机的"程序公式化"，由下面描述的 Emil Post 的图灵等价的计算模型构成。(Post 的模型和图灵的模型，尽管相互之间非常类似，但却是独立开发的。图灵的论文在 1936 年五月出版，Post 的论文在十月出版。) Post-图灵机使用二元字母表，无限序列的二元存储位置，和带有在存储位置上双向移动和一次一个更改其内容的指令的原始编程语言。"Post-图灵程序"和 "Post-图灵机"的名字由 Martin Davis 在 1973年-1974年使用 (Davis 1973, p.69ff)。后来 Davis 在 1980 年使用名字 "Turing-Post 程序" (Davis, in Steen p. 241)。
lexicalization	zho: 波斯特-图灵机

Media
media:img	2 state busy beaver 2.JPG
media:img	2 state busy beaver.JPG
media:img	Algorithm P-T multiply 2.JPG
media:img	State diagram 2 state busy beaver .JPG
media:img	State diagram 2 state busy beaver 2 .JPG