最終更新日：2025/11/21
(logic) A branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as What does it mean for a function on the natural numbers to be computable?
and Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?
.
音声機能が動作しない場合はこちらをご確認ください
正解を見る
recursion theory
編集履歴（0）
元となった辞書の項目
recursion theory
名詞
不可算名詞
(logic)
A
branch
of
mathematical
logic
studying
computable
functions
and
Turing
degrees,
concerned
with
questions
such
as
"What
does
it
mean
for
a
function
on
the
natural
numbers
to
be
computable?"
and
"Can
noncomputable
functions
be
classified
into
a
hierarchy
based
on
their
level
of
noncomputability?".
日本語の意味
数学的論理学の一分野で、計算可能な関数やチューリング度について研究する領域。自然数上の関数が計算可能であるとはどういう意味か、また非計算可能な関数がその非計算可能性の度合いに応じて階層化できるかどうかといった問いに取り組む。
意味（1）
(logic)
A
branch
of
mathematical
logic
studying
computable
functions
and
Turing
degrees,
concerned
with
questions
such
as
"What
does
it
mean
for
a
function
on
the
natural
numbers
to
be
computable?"
and
"Can
noncomputable
functions
be
classified
into
a
hierarchy
based
on
their
level
of
noncomputability?".
