recursion theory

English

recursion theory (uncountable)

(logic) A branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as "What does it mean for a function from the natural numbers to themselves to be computable?" and "Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?".

单词	recursion theory
释义	recursion theory English Noun recursion theory (uncountable) (logic) A branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as "What does it mean for a function from the natural numbers to themselves to be computable?" and "Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?". Synonyms computability theory
随便看	Corlățanu Corlățean Corlățeanu Corlățel Corlățianu corm Corma Cormac Cormac Cond Longas Cormack Cormag Cormaic Cormalos Corman corman Cormans Cormany Cormanys cormaran Corme corme cormel cormels Cormeniș cormes