전문 번역가, 번역 회사, 웹 페이지 및 자유롭게 사용할 수 있는 번역 저장소 등을 활용합니다.
Επιλογές 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
품질: