Turing machine

短语

[计] 图灵机

词形变化

Turing machines 复数 Turing machines

别名

TM

释义与例句

n.
  1. 1.

    An abstract computing machine that has a finite number of possible internal states and operates on an infinite memory tape by first reading a symbol from a cell in the tape, and then, deterministically, based on that symbol and the machine’s state, writing a symbol in that cell, moving to a neighboring cell, and/or changing state.

    图灵机

    确定型图灵机

    计算机 工程 数学

词汇关系

词源

Named after English mathematician, logician, and cryptographer Alan Turing (1912–1954), who introduced the concept in 1936 to give a mathematically precise definition of computability. Turing called it an a-machine; the term "Turing machine" was coined by his doctoral advisor Alonzo Church.

来源:wiktionary