＞数理逻辑与数学基础＞递归论＞释义 Church-Turing thesis 丘奇-图灵论题 Church-Turing thesis 丘奇-图灵论题
理论计算机科学 可计算性与计算复杂性 释文 Church-Turing thesis 丘奇-图灵论题
- set of infinite type
- set of information
- set of integers
- set of less power
- set of local coordinate cards
- set of local frames
- set of lower bounds
- set of mappings
- set of matrices
- set of measure zero
- set of multiples
- set of multiplicity
- set of natural numbers
- set of non-uniqueness
- set of nowhere dense
- set of numbers
- set of objectives
- set of objects
- set of observations
- set of pairs
- set of points
- set of poles
- set of premises
- set of procedures for manufacturing process
- set of procedures' relations