来自专业的译者、企业、网页和免费的翻译库。
Επιλογές recursive
recursive options
最后更新: 2020-04-20
使用频率: 1
质量:
Μέγιστο επίπεδο βάθους σε recursive mode
maximum depth in recursive mode
最后更新: 2020-04-20
使用频率: 1
质量:
Μετατροπή σχετικών δεσμών σε recursive mode.
convert to relative links in recursive mode.
最后更新: 2020-04-20
使用频率: 1
质量:
"hierarchies of provably recursive functions".
"hierarchies of provably recursive functions".
最后更新: 2016-03-03
使用频率: 1
质量:
警告:包含不可见的HTML格式
"recursive unsolvability of a problem of thue.
"recursive unsolvability of a problem of thue.
最后更新: 2016-03-03
使用频率: 1
质量:
警告:包含不可见的HTML格式
"the upper semi-lattice of degrees of recursive unsolvability.
"the upper semi-lattice of degrees of recursive unsolvability.
最后更新: 2016-03-03
使用频率: 1
质量:
警告:包含不可见的HTML格式
"handbook of recursive mathematics", north-holland (1998).
"handbook of recursive mathematics", north-holland (1998).
最后更新: 2016-03-03
使用频率: 1
质量:
警告:包含不可见的HTML格式
"computability, an introduction to recursive function theory", cambridge university press.
"computability, an introduction to recursive function theory", cambridge university press.
最后更新: 2016-03-03
使用频率: 1
质量:
警告:包含不可见的HTML格式
"the theory of recursive functions and effective computability", second edition 1987, mit press.
"the theory of recursive functions and effective computability", second edition 1987, mit press.
最后更新: 2016-03-03
使用频率: 1
质量:
警告:包含不可见的HTML格式
(these infinitely recursive corrugations are used only for embedding into three dimensions; they are not an intrinsic feature of the flat torus.
(these infinitely recursive corrugations are used only for embedding into three dimensions; they are not an intrinsic feature of the flat torus.
最后更新: 2016-03-03
使用频率: 1
质量:
for example, the theory of primitive recursive arithmetic (pra), which is widely accepted as an accurate formalization of finitistic mathematics, is provably consistent in pa.
for example, the theory of primitive recursive arithmetic (pra), which is widely accepted as an accurate formalization of finitistic mathematics, is provably consistent in pa.
最后更新: 2016-03-03
使用频率: 1
质量:
* r. statman: the typed lambda-calculus is not elementary recursive focs 1977: 90-94* w. d. goldfarb: the undecidability of the 2nd order unification problem, tcs (1981), no.
* r. statman: the typed lambda-calculus is not elementary recursive focs 1977: 90-94* w. d. goldfarb: the undecidability of the 2nd order unification problem, tcs (1981), no.
最后更新: 2016-03-03
使用频率: 1
质量: