計算可能性理論
1. Computability theoryComputability theory, also called recursion theory, is a branch of mathematical logic and computer science that originated in the 1930s with the study of computable functions and Turing degrees. The field has since grown to include the study of generalized computability and definability. In these areas, recursion theory overlaps with proof theory and effective descriptive set theory.
Read “Computability theory” on English Wikipedia
Read “計算可能性理論” on Japanese Wikipedia
Read “Computability theory” on DBpedia
Read “Computability theory” on English Wikipedia
Read “計算可能性理論” on Japanese Wikipedia
Read “Computability theory” on DBpedia
Discussions
Log in to talk about this word.