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）。

The article Turing machine gives a general introduction to Turing machines, while this article covers a specific class of Turing machines.

A Post–Turing machine is a "program formulation" of an especially simple type of Turing machine, comprising a variant of Emil Post's Turing-equivalent model of computation described below. (Post's model and Turing's model, though very similar to one another, were developed independently. Turing's paper was received for publication in May 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).