Você procurou por: recursive (Grego - Inglês)

Επιλογές recursive
recursive options

Μέγιστο επίπεδο βάθους σε recursive mode
maximum depth in recursive mode

Μετατροπή σχετικών δεσμών σε recursive mode.
convert to relative links in recursive mode.

"hierarchies of provably recursive functions".
"hierarchies of provably recursive functions".

"recursive unsolvability of a problem of thue.
"recursive unsolvability of a problem of thue.

"the upper semi-lattice of degrees of recursive unsolvability.
"the upper semi-lattice of degrees of recursive unsolvability.

"handbook of recursive mathematics", north-holland (1998).
"handbook of recursive mathematics", north-holland (1998).

"computability, an introduction to recursive function theory", cambridge university press.
"computability, an introduction to recursive function theory", cambridge university press.

"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.

(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.

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.

* 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.