最終更新日：2025/11/20
(computing theory) 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.
音声機能が動作しない場合はこちらをご確認ください
正解を見る
Turing machine
編集履歴（0）
元となった辞書の項目
Turing machine
名詞
(computing
theory)
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.
日本語の意味
抽象的な計算モデルであり、無限の記憶テープ上で動作する。有限の内部状態を持ち、テープ上の記号を読んで、決定論的に記号を書き換えたり、テープ上の隣接するセルに移動したり、状態を変更したりする。
意味（1）
(computing
theory)
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.
（ plural ）
