recursion theory

英語（米国） (en-US) 英語（イギリス） (en-GB)

名詞

不可算名詞

(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?".

日本語の意味

数学的論理学の一分野で、計算可能な関数やチューリング度について研究する領域。自然数上の関数が計算可能であるとはどういう意味か、また非計算可能な関数がその非計算可能性の度合いに応じて階層化できるかどうかといった問いに取り組む。

英語の意味

(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?".

このボタンはなに？

During the conference, the keynote speaker argued that recursion theory offers a deeper understanding of which functions on the natural numbers can be computed.

会議中、基調講演者は、どの自然数上の関数が計算可能かをより深く理解するために計算可能性理論が役立つと主張した。

詳細

意味（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?".