Results 21 to 30 of about 31,249 (277)
General Recursion and Formal Topology [PDF]
, 2010 It is well known that general recursion cannot be expressed within Martin-Loef's type theory and various approaches have been proposed to overcome this problem still maintaining the termination of the computation of the typable terms.
Silvio Valentini +5 more
core +1 more source
Recursion in Recursion: Two-Level Nested Recursion for Length Generalization with Scalability
Advances in Neural Information Processing Systems 36, 2023 Binary Balanced Tree RvNNs (BBT-RvNNs) enforce sequence composition according to a preset balanced binary tree structure. Thus, their non-linear recursion depth is just $\log_2 n$ ($n$ being the sequence length). Such logarithmic scaling makes BBT-RvNNs efficient and scalable on long sequence tasks such as Long Range Arena (LRA).
Jishnu Ray Chowdhury, Cornelia Caragea
openaire +3 more sources
Journal of High Energy Physics, 2023 Abstract We examine the BCFW recursion relations for celestial amplitudes and how they inform the celestial bootstrap program. We start by recasting the celestial incarnation of the BCFW shift as a generalization of the action of familiar asymptotic symmetries on hard particles, before focusing on two limits: z → ∞ and z → 0.
Yangrui Hu, Sabrina Pasterski
openaire +3 more sources
Integrable discretization of recursion operators and unified bilinear forms to soliton hierarchies [PDF]
Open Communications in Nonlinear Mathematical PhysicsIn this paper, we give a procedure for discretizing recursion operators by utilizing unified bilinear forms within integrable hierarchies. To illustrate this approach, we present unified bilinear forms for both the AKNS hierarchy and the KdV hierarchy ...
Xingbiao Hu, Guofu Yu, Yingnan Zhang
doaj +1 more source
The Acquisition of Recursion: How Formalism Articulates the Child’s Path
Biolinguistics, 2011 We distinguish three kinds of recursion: Direct Recursion (which delivers a ‘conjunction’ reading), Indirect Recursion, and Generalized Transformations. The essential argument is that Direct Recursion captures the first stage of each recursive structure.
Tom W. Roeper
doaj +1 more source
Computability and Recursion [PDF]
Bulletin of Symbolic Logic, 1996 AbstractWe consider the informal concept of “computability” or “effective calculability” and two of the formalisms commonly used to define it, “(Turing)computability” and “(general)recursiveness”. We consider their origin, exact technical definition, concepts, history, general English meanings, how they became fixed in their present roles, how they ...
openaire +1 more source
Recursive and Fast Recursive Capon Spectral Estimators [PDF]
EURASIP Journal on Advances in Signal Processing, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jacob Benesty +2 more
openaire +5 more sources
Diller-Nahm Bar Recursion [PDF]
, 2023 International audienceWe present a generalization of Spector's bar recursion to the Diller-Nahm variant of Gödel's Dialectica interpretation. This generalized bar recursion collects witnesses of universal formulas in sets of approximation sequences to ...
Blot, Valentin
core +1 more source
Recursión, inducción y órdenes bien fundados
Revista Integración, 2011 Con base en la caracterización de los números naturales a partir de la propiedad de recursión (ver [2]), probamos en forma general que para un conjunto dado las propiedades de recursión, inducción y buena fundación son equivalentes entre sí.
Carlos Parra-Londoño +1 more
doaj +4 more sources
Cybernetics and Information Technologies, 2021 Merkle-Hellman public key cryptosystem is a long-age old algorithm used in cryptography. Despite being computationally fast, for very large input sizes it may operate slower due to thread creation overhead or reaching a deadlock situation. In this paper,
Rahul Vaddadi Sai +2 more
doaj +1 more source