Search results for "Recursion"
showing 10 items of 61 documents
The terminal hyperspace of homogeneous continua
2010
Abstract We investigate the structure of the collection of terminal subcontinua in homogeneous continua. The main result is a reduction of this structure to six specific types. Three of these types are of one-dimensional spaces, and examples representing these types are known. It is not known whether higher dimensional examples having non-trivial terminal subcontinua and representing the three remaining types exist.
Centre-embedded structures are a by-product of associative learning and working memory constraints: Evidence from baboons (Papio Papio)
2012
International audience; Influential theories have claimed that the ability for recursion forms the computational core of human language faculty distinguishing our communication system from that of other animals (Hauser, Chomsky, & Fitch, 2002). In the present study, we consider an alternative view on recursion by studying the contribution of associative and working memory processes. After an intensive paired-associate training with visual shapes, we observed that baboons spontaneously ordered their responses in keeping with a recursive, centre-embedded structure. This result suggests that the human ability for recursion might partly if not entirely originate from fundamental processing cons…
Measure, category and learning theory
1995
Measure and category (or rather, their recursion theoretical counterparts) have been used in Theoretical Computer Science to make precise the intuitive notion “for most of the recursive sets.” We use the notions of effective measure and category to discuss the relative sizes of inferrible sets, and their complements. We find that inferrible sets become large rather quickly in the standard hierarchies of learnability. On the other hand, the complements of the learnable sets are all large.
Tridiagonality, supersymmetry and non self-adjoint Hamiltonians
2019
In this paper we consider some aspects of tridiagonal, non self-adjoint, Hamiltonians and of their supersymmetric counterparts. In particular, the problem of factorization is discussed, and it is shown how the analysis of the eigenstates of these Hamiltonians produce interesting recursion formulas giving rise to biorthogonal families of vectors. Some examples are proposed, and a connection with bi-squeezed states is analyzed.
Induced and reduced unbounded operator algebras
2012
The induction and reduction precesses of an O*-vector space \({{\mathfrak M}}\) obtained by means of a projection taken, respectively, in \({{\mathfrak M}}\) itself or in its weak bounded commutant \({{\mathfrak M}^\prime_{\rm w}}\) are studied. In the case where \({{\mathfrak M}}\) is a partial GW*-algebra, sufficient conditions are given for the induced and the reduced spaces to be partial GW*-algebras again.
Test of molecular mode coupling theory for general rigid molecules
2000
We report recent progress on the test of mode coupling theory for molecular liquids (MMCT) for molecules of arbitrary shape. The MMCT equations in the long time limit are solved for supercooled water including all molecular degrees of freedom. In contrast to our earlier treatment of water as a linear molecule, we find that the glass-transition temperature ${T}_{c}$ is overestimated by the theory as was found in the case of simple liquids. The nonergodicity parameters are calculated from the ``full'' set of MMCT equations truncated at ${l}_{\mathrm{co}}=2.$ These results are compared (i) with the nonergodicity parameters from MMCT with ${l}_{\mathrm{co}}=2$ in the ``dipole'' approximation ${…
Physical forcing and physical/biochemical variability of the Mediterranean Sea: a review of unresolved issues and directions for future research
2014
Malanotte-Rizzoli, Paola ... et. al.-- 76 pages
SUSY Ward identities for multi-gluon helicity amplitudes with massive quarks
2006
We use supersymmetric Ward identities to relate multi-gluon helicity amplitudes involving a pair of massive quarks to amplitudes with massive scalars. This allows to use the recent results for scalar amplitudes with an arbitrary number of gluons obtained by on-shell recursion relations to obtain scattering amplitudes involving top quarks.
Suffixes, Conjugates and Lyndon Words
2013
In this paper we are interested in the study of the combinatorial aspects connecting three important constructions in the field of string algorithms: the suffix array, the Burrows-Wheeler transform (BWT) and the extended Burrows-Wheeler transform (EBWT). Such constructions involve the notions of suffixes and conjugates of words and are based on two different order relations, denoted by $\plex$ and $\pom$, that, even if strictly connected, are quite different from the computational point of view. In this study an important role is played by Lyndon words. In particular, we improve the upper bound on the number of symbol comparisons needed to establish the $\pom$ order between two primitive wo…
An advanced variant of an interpolatory graphical display algorithm
2004
In this paper an advanced interpolatory graphical display algorithm based on cardinal B-spline functions is provided. It is well-known that B-spline functions are a flexible tool to design various scale rapresentations of a signal. The proposed method allows to display without recursion a function at any desiderable resolution so that only initial data and opportune vectors weight are involved. In this way the structure of the algorithm is independent across the scale and a computational efficiency is reached. In this paper mono and bi-dimensional vectors weight generated by means of centered cubic cardinal B-spline functions have been supplied. (© 2004 WILEY-VCH Verlag GmbH & Co. KGaA, Wei…