最終更新日
：2024/07/28
Turing machine
noun
(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.
復習用の問題
(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
A Turing machine is a mathematical model of computation that defines an abstract machine.
正解を見る
A Turing machine is a mathematical model of computation that defines an abstract machine.
English Dictionary
項目の編集設定
- 項目の編集権限を持つユーザー - すべてのユーザー
- 項目の新規作成を審査する
- 項目の編集を審査する
- 項目の削除を審査する
- 重複の恐れのある項目名の追加を審査する
- 項目名の変更を審査する
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
例文の編集設定
- 例文の編集権限を持つユーザー - すべてのユーザー
- 例文の削除を審査する
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
問題の編集設定
- 問題の編集権限を持つユーザー - すべてのユーザー
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
