computability theory (recursion theory) The branch of mathematics and computer science that focuses on the theoretical limits of computers and algorithms and whether certain problems are decidable. See halting problem, Turing machine.
computability theory
数学辞典收录了4151条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。