Results 211 to 220 of about 162,209 (248)

Recursive and Recursively Enumerable Sets

1987
In the previous chapters we have studied computable functions f: ℕk → N and f: (W(Σ))k→W(Σ). The concept of computability is now used to define recursiveness and recursive enumerability of subsets A ⊆ ℕk and B ⊆ (W(Σ))k.
openaire   +1 more source

Recursive Dilators and Generalized Recursions

1982
Abstract We establish links between Girard's notion of recursive dilator and generalized recursions like Normann'f E-recursion and Hinman's (∞, 0)-recursion as well as with the concept of function uniformly ∞-definable over all admissible sets.
openaire   +1 more source

Recursive Equivalence

Bulletin of the London Mathematical Society, 1970
openaire   +1 more source

“Persian” Recursion

Mathematics Magazine, 1997
openaire   +1 more source

Direct Proof of the Tree-Level Scattering Amplitude Recursion Relation in Yang-Mills Theory

Physical Review Letters, 2005
Freddy Cachazo, Bo Feng
exaly  

Recursive/Recursivity

2001
openaire   +1 more source

Multiple Recursion

Mathematical Logic Quarterly, 1962
openaire   +2 more sources

A simple recursion polynomial expansion of the Green’s function with absorbing boundary conditions. Application to the reactive scattering

Journal of Chemical Physics, 1995
Vladimir A Mandelshtam
exaly  

Double recursion, mutual recursion, recursive calls

1984
openaire   +1 more source

A recursion formula for resistance distances and its applications

Discrete Applied Mathematics, 2013
Yujun Yang, Douglas J Klein
exaly